An efficient algorithm for constructing reversible quasi-cyclic codes via Chinese remainder theorem
DOI10.1016/J.FFA.2023.102204zbMATH Open1520.94098OpenAlexW4365506107WikidataQ123207431 ScholiaQ123207431MaRDI QIDQ6156917FDOQ6156917
Authors: Norifumi Ojiro, Kakeru Kaneko, Hajime Matsui 
Publication date: 19 June 2023
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2023.102204
Recommendations
- On a Class of Reversible Binary Cyclic Codes and their Algebraic Decoding
- A Chinese remainder theorem approach to skew generalized quasi-cyclic codes over finite fields
- scientific article; zbMATH DE number 515913
- Quasi-cyclic codes: algebraic properties and applications
- Construction of reversible cyclic codes over ℤpk
- A \(q\)-polynomial approach to cyclic codes
- Some results on quasi-cyclic codes
- scientific article; zbMATH DE number 7180100
- A note on quasi-cyclic codes
- Constructing quasi-cyclic codes from linear algebra theory
dual codeslinear codesself-dual codeserror-correcting codesreversible codesreciprocal polynomialsgenerator polynomial matricesreversed codes
Cites Work
- Searching for linear codes with large minimum distance
- On the algebraic structure of quasi-cyclic codes .I. Finite fields
- Reversible codes
- A Gilbert-Varshamov bound for quasi-cycle codes of rate 1/2 (Corresp.)
- Structure and performance of generalized quasi-cyclic codes
- On generator and parity-check polynomial matrices of generalized quasi-cyclic codes
Cited In (3)
This page was built for publication: An efficient algorithm for constructing reversible quasi-cyclic codes via Chinese remainder theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6156917)
