On codes with unique decoding to the nearest

MaRDI QIDQ6899652zbMATH OpenFDO

Authors D. S. Ananichev, K. L. Geut, S. S. Titov

Publication date 14 November 2025

Published in Prikladnaya Diskretnaya Matematika. Supplement (Search for Journal in Brave)

zbMATH Keywords

codeHamming weightmatroidNSUCRYPTO

Mathematics Subject Classification ID

Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cites work

• A THEOREM ON INDEPENDENCE RELATIONS
• An Introduction to Matroid Theory
• Matroids and the greedy algorithm
• On the abstract properties of linear dependence.
• Theory of Matroids

This page was built for publication: On codes with unique decoding to the nearest

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