We investigate various aspects of operator quantum error-correcting codes or, as we prefer to call them, subsystem codes. We give various methods to derive subsystem codes from classical codes. We give a proof for the existence of subsystem codes using a counting argument similar to the quantum Gilbert-Varshamov bound. We derive linear programming bounds and other upper bounds. We answer the qu...

In this paper, a generic method to derive subsystem codes from existing subsystem codes is given that allows one to trade the dimensions of subsystem and co-subsystem while maintaining or improving the minimum distance. As a consequence, it is shown that all pure MDS subsystem codes are derived from MDS stabilizer codes. Furthermore, a simple construction of pure MDS subsystem codes is obtained...

A bstract We investigate the spontaneous breaking of subsystem symmetries directly in context continuum field theories by calculating correlation function charged operators. Our methods confirm lack symmetry some existing with symmetries, as had previously been established based on a careful analysis spectrum. present novel theory constructions that do exhibit whenever allowed general principle...

The natural languageprocessingcomponentof a speechunderstanding system is commonly a robust, semantic parser, implemented as either a chart-based transition network, or as a generalized leftright (GLR) parser. In contrast, we are developing a robust, semantic parser that is a single, predictive finite-state machine. Our approach is motivated by our belief that such a finite-state parser can ult...

In this paper we compare pronoun resolution algorithms and introduce a centering algorithm (LeftRight Centering) that adheres to the constraints and rules of centering theory and is an alternative to Brennan, Friedman, and Pollard's (1987) algorithm. We then use the Left-Right Centering algorithm to see if two psycholinguistic claims on Cf-list ranking will actually improve pronoun resolution a...

bin(k-1 ;n,p) = L n p xqn-x, the cumulative binomial function. k-1 ( ) x=o x C=the total of the cost of the subsystem itself plus the expected cost due to subsystem failure c1 = loss due to failure of the subsystem c3 =cost of a one module subsystem capable of full output c4 =cost of a module in a k-out-of-n:G (good) subsystem when k is fixed g(k) = the function relating cost of the subsystem t...