On Repeated-Single-Root Constacyclic Codes

DOI10.1007/978-1-4615-2694-0_10MaRDI QIDQ4857229zbMATH OpenOpenAlexFDO

Authors V. C. jun. da Rocha

Publication date 10 July 1996

Published in Communications and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-1-4615-2694-0_10

zbMATH Keywords

constacyclic codescryptosystemsmaximum distance separable codesminimum Hamming distanceparity-check matrixReed-Solomon codes

Mathematics Subject Classification ID

Cryptography (94A60) Linear codes (general theory) (94B05) Cyclic codes (94B15)

Recommendations

• On repeated-root cyclic codes
• Repeated-root constacyclic codes of length
• Repeated-root constacyclic codes of length \(n l p^s\)
• Repeated-root constacyclic codes of length k p^s
• Repeated-root constacyclic codes of length \(\ell p^s\) and their duals
• On generalizations of repeated-root cyclic codes
• Repeated-root constacyclic codes of length \(\ell^{t}p^{s}\) and their dual codes
• Repeated-root constacyclic codes of length \(2 \ell^m p^n\)
• Some Repeated-Root Constacyclic Codes Over Galois Rings
• Repeated-root constacyclic codes of prime power length

Cited in

(3)

• Decoding of repeated-root cyclic codes up to new bounds on their minimum distance
• On repeated-root cyclic codes
• Repeated-root constacyclic codes of length

This page was built for publication: On Repeated-Single-Root Constacyclic Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4857229)