Spectral enumerators for certain additive-error-correcting codes over integer alphabets

DOI10.1016/S0019-9958(81)90645-8zbMath0523.94020OpenAlexW2085140716MaRDI QIDQ3037318

Philippe Delsarte, Ph. Piret

Publication date: 1981

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(81)90645-8

zbMATH Keywords

decodingblock codesenumeration problemsadditive errorscheck equation over a finite Abelian groupextension of the Varshamov and Constantin-Rao codesgeneralized Varshamov codesspectral enumerators

Mathematics Subject Classification ID

Arithmetic codes (94B40)

Related Items (3)

A construction of \(V_{h}\)-sequences and its application to binary asymmetric error-correcting codes ⋮ The Modular Subset-Sum Problem and the size of deletion correcting codes ⋮ Deletion correcting codes meet the Littlewood-Offord problem

This page was built for publication: Spectral enumerators for certain additive-error-correcting codes over integer alphabets