An efficient algorithm for constructing reversible quasi-cyclic codes via Chinese remainder theorem

DOI10.1016/j.ffa.2023.102204zbMath1520.94098OpenAlexW4365506107WikidataQ123207431 ScholiaQ123207431MaRDI QIDQ6156917

Hajime Matsui, Kakeru Kaneko, Norifumi Ojiro

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

zbMATH Keywords

linear codesself-dual codeserror-correcting codesdual codesreversible codesreciprocal polynomialsgenerator polynomial matricesreversed codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cyclic codes (94B15)

Cites Work

• On generator and parity-check polynomial matrices of generalized quasi-cyclic codes
• Structure and performance of generalized quasi-cyclic codes
• Searching for linear codes with large minimum distance
• A Gilbert-Varshamov bound for quasi-cycle codes of rate 1/2 (Corresp.)
• On the algebraic structure of quasi-cyclic codes .I. Finite fields
• Reversible codes

This page was built for publication: An efficient algorithm for constructing reversible quasi-cyclic codes via Chinese remainder theorem