A note on the q-ary image of a q/sup m/-ary repeated-root cyclic code
- 1 March 1997
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 43 (2), 732-737
- https://doi.org/10.1109/18.556131
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The q-ary image of a q/sup m/-ary cyclic codeIEEE Transactions on Information Theory, 1995
- A counter-example to a recent result on theq-ary image of aq s -ary cyclic codeDesigns, Codes and Cryptography, 1994
- Linear cyclic codes of wordlength v over GF(q s ) which are also linear cyclic codes of wordlength sv over GF(q)Designs, Codes and Cryptography, 1991
- On repeated-root cyclic codesIEEE Transactions on Information Theory, 1991
- Repeated-root cyclic codesIEEE Transactions on Information Theory, 1991
- The trace description of irreducible quasi-cyclic codesIEEE Transactions on Information Theory, 1990
- A binary extremal doubly even self-dual code (64,32,12) obtained from an extended Reed-Solomon code over Fl6 (Corresp.)IEEE Transactions on Information Theory, 1981
- Decoding of circulant codes (Corresp.)IEEE Transactions on Information Theory, 1970
- On Binary Cyclic Codes Which are Also Cyclic Codes Over $GF(2^s )$SIAM Journal on Applied Mathematics, 1970
- On Cyclic Codes for Multi-Phase Data Transmission SystemsJournal of the Society for Industrial and Applied Mathematics, 1964