Circulant bases for cyclic codes (Corresp.)
From MaRDI portal
Publication:5682226
DOI10.1109/TIT.1970.1054478zbMath0264.94008OpenAlexW2014508048MaRDI QIDQ5682226
Sudhakar M. Reddy, Charles W. Hoffner II
Publication date: 1970
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1970.1054478
Related Items (5)
The generation of rimitive olynomials in GF(q) with independent roots and their applications for ower residue codes, VLSI testing and finite field multipliers using normal basis ⋮ Algebraic theory of block codes detecting independent errors ⋮ Constructing rate \(1/p\) systematic binary quasi-cyclic codes based on the matroid theory ⋮ A survey of constructive coding theory, and a table of binary codes of highest known rate ⋮ Abelian group factorization from cyclic and quasi-cyclic codes
This page was built for publication: Circulant bases for cyclic codes (Corresp.)