Minimal-Memory, Noncatastrophic, Polynomial-Depth Quantum Convolutional Encoders
نویسندگان
چکیده
منابع مشابه
Minimal-memory realization of pearl-necklace encoders of general quantum convolutional codes
Quantum convolutional codes, like their classical counterparts, promise to offer higher error correction performance than block codes of equivalent encoding complexity, and are expected to find important applications in reliable quantum communication where a continuous stream of qubits is transmitted. Grassl and Roetteler devised an algorithm to encode a quantum convolutional code with a “pearl...
متن کاملMinimal trellis construction from convolutional ring encoders
The paper addresses minimality of encoders for basic convolutional codes over Zpr by using a recently developed concept of row reducedness for polynomial matrices over Zpr . It is known in the literature that the McMillan degree of a basic encoder is an upper bound for the minimum number of trellis states, but a general expression is missing. This open problem is solved in this paper. An expand...
متن کاملA linear algebra approach to minimal convolutional encoders
This semitutorial paper starts with a review of some of Fomey’s contributions on the algebraic structure of convolutional encoders on which some new results on minimal convolutional encoders rest. An example is given of a basic convolutional encoding matrix whose number of abstract states is minimal over all equivalent encoding matrices. However, this encoding matrix can be realized with a mini...
متن کاملSystem-theoretic properties of convolutional codes over rings
Convolutional codes over rings are particularly suitable for representing codes over phase modulation signals. In order to develop a complete structural analysis of this class of codes, it is necessary to study rational matrices over rings, which constitutes the generator matrices (encoders) for such convolutional codes. Noncatastrophic, minimal, systematic and basic generator matrices are intr...
متن کاملHigh-rate systematic recursive convolutional encoders: minimal trellis and code search
We consider high-rate systematic recursive convolutional encoders to be adopted as constituent encoders in turbo schemes. Douillard and Berrou showed that, despite its complexity, the construction of high-rate turbo codes by means of high-rate constituent encoders is advantageous over the construction based on puncturing rate-1/2 constituent encoders. To reduce the decoding complexity of high-r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2013
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2012.2220520