Cyclic codes over GF(q) with simple orbit structure
From MaRDI portal
Publication:1821757
DOI10.1016/0012-365X(86)90087-7zbMath0616.94010OpenAlexW2169826209MaRDI QIDQ1821757
Publication date: 1986
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(86)90087-7
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Equidistant cyclic codes over GF(q)
- How to compute the minimum distance for cyclic AN-codes over an arbitrary base I. Elementary methods
- On the evaluation of minimum distance of binary arithmetic cyclic codes
- Finite Rings Having a Cyclic Multiplicative Group of Units
This page was built for publication: Cyclic codes over GF(q) with simple orbit structure