On maximum length convolutional codes under a trellis complexity constraint
Journal of Complexity - Special issue on coding and cryptography
On nonbinary quantum convolutional BCH codes
Quantum Information & Computation
| Hi-index | 754.84 |
The author denotes by w0 the minimum average weight per edge over all nonzero cycles in the state diagram for a convolutional code, and assumes that a technique is available for generating canonical parity-check matrices for codes with increasing degree m. The obtained class of codes is asymptotically catastrophic if w0 approaches zero for large m. We prove the existence of convolutional code classes that are not asymptotically catastrophic by providing explicit constructions of codes with nonzero w0 for all m