On Repeated-Single-Root Constacyclic Codes

DOI10.1007/978-1-4615-2694-0_10zbMATH Open0840.94023OpenAlexW91966705MaRDI QIDQ4857229FDOQ4857229

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 codesReed-Solomon codesmaximum distance separable codescryptosystemsparity-check matrixminimum Hamming distance

Mathematics Subject Classification ID

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

Cited In (2)

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

Recommendations

• Title not available (Why is that?) 👍 👎
• Repeated-root constacyclic codes of length \(\ell p^s\) and their duals 👍 👎
• On generalizations of repeated-root cyclic codes 👍 👎
• On repeated-root cyclic codes 👍 👎
• Repeated-root constacyclic codes of length 👍 👎
• 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\) 👍 👎
• Repeated-root constacyclic codes of length \(k\ell p^s\) 👍 👎
• Repeated-root constacyclic codes of length \(n l p^s\) 👍 👎
• Some Repeated-Root Constacyclic Codes Over Galois Rings 👍 👎

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)