On modular weights in arithmetic codes

DOI10.1007/3-540-19368-5_6zbMATH Open0645.94013OpenAlexW1544082078MaRDI QIDQ3789482FDOQ3789482

Antoine Lobstein

Publication date: 1988

Published in: Coding Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-19368-5_6

Recommendations

• scientific article
• Error control by product codes in arithmetic units
• Comments on "A note on perfect arithmetic codes
• Equidistant arithmetic codes and character sums
• scientific article

zbMATH Keywords

minimal formarithmetic codestriangular inequalitymodular distancearithmetic weightgeneralized nonadjacent form

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Arithmetic codes (94B40)

Cited In (4)

• Title not available (Why is that?)
• Equidistant arithmetic codes and character sums
• Title not available (Why is that?)
• A note on perfect arithmetic codes (Corresp.)

This page was built for publication: On modular weights in arithmetic codes

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