Cyclic concatenated codes with constacyclic outer codes
- 1 May 1992
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 38 (3) , 950-959
- https://doi.org/10.1109/18.135637
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- More on the minimum distance of cyclic codesIEEE Transactions on Information Theory, 1991
- Pseudocyclic maximum-distance-separable codesIEEE Transactions on Information Theory, 1990
- Cyclic unequal error protection codes constructed from cyclic codes of composite lengthIEEE Transactions on Information Theory, 1988
- Duadic codes (Corresp.)IEEE Transactions on Information Theory, 1987
- On the minimum distance of cyclic codesIEEE Transactions on Information Theory, 1986
- Duadic CodesIEEE Transactions on Information Theory, 1984
- The minimum distance of all binary cyclic codes of odd lengths from 69 to 99IEEE Transactions on Information Theory, 1978
- Construction and decomposition of cyclic codes of composite length (Corresp.)IEEE Transactions on Information Theory, 1974
- Long primitive binary BCH codes have distanced leq 2n ln R^{-1}/log n cdotsIEEE Transactions on Information Theory, 1972
- Semisimple cyclic and Abelian codes. IICybernetics and Systems Analysis, 1970