On a Class of Reversible Binary Cyclic Codes and their Algebraic Decoding
From MaRDI portal
Publication:4298539
DOI10.1080/02522667.1994.10699171zbMath0798.94010OpenAlexW2323973100MaRDI QIDQ4298539
Publication date: 2 August 1994
Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02522667.1994.10699171
Related Items (1)
DNA cyclic codes over the ring 𝔽2[u,v/〈u2 − 1,v3 − v,uv − vu〉]
Cites Work
- Unnamed Item
- A Cyclic Code for Double Error Correction [Letter to the Editor]
- A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes
- Algebraic decoding beyond e/sub BCH/ of some binary cyclic codes, when e<e/sub BCH/
- Decoding cyclic and BCH codes up to actual minimum distance using nonrecurrent syndrome dependence relations
- The algebraic decoding of the (41, 21, 9) quadratic residue code
- Algebraic decoding of the Zetterberg codes
- Reversible codes
- On the minimum distance of certain reversible cyclic codes (Corresp.)
This page was built for publication: On a Class of Reversible Binary Cyclic Codes and their Algebraic Decoding