Construction and decomposition of cyclic codes of composite length (Corresp.)
- 1 September 1974
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 20 (5) , 680-683
- https://doi.org/10.1109/tit.1974.1055263
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Some long cyclic linear binary codes are not so badIEEE 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
- On generalized ReedMuller codes and their relativesInformation and Control, 1970
- Some lower bounds on the minimum weight of cyclic codes of composite lengthIEEE Transactions on Information Theory, 1968
- Factorization of cyclic codesIEEE Transactions on Information Theory, 1967
- A New Treatment of Bose-Chaudhuri CodesJournal of the Society for Industrial and Applied Mathematics, 1961