Finding an asymptotically bad family of q-th power residue codes

DOI10.3934/AMC.2009.3.53zbMATH Open1232.94018OpenAlexW2006366049MaRDI QIDQ2268239FDOQ2268239

P. Charters

Publication date: 10 March 2010

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2009.3.53

Recommendations

• Generalizing binary quadratic residue codes to higher power residues over larger fields
• Asymptotically good codes
• scientific article
• Quadratic residue codes over \(\mathbb{F}_l+v\mathbb{F}_l\)
• Quadratic residues codes of prime power length over \(\mathbb Z_4\)

zbMATH Keywords

coding theoryquadratic residue codesChebotarev's density theorem

Mathematics Subject Classification ID

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

Cited In (1)

• Generalizing binary quadratic residue codes to higher power residues over larger fields

This page was built for publication: Finding an asymptotically bad family of \(q\)-th power residue codes

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