Variable-length integer codes based on the Goldbach conjecture, and other additive codes

DOI10.1109/TIT.2002.800483MaRDI QIDQ4677562zbMATH OpenOpenAlexWikidataFDO

Authors Peter Fenwick

Publication date 11 May 2005

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2002.800483

Mathematics Subject Classification ID

Goldbach-type theorems; other additive questions involving primes (11P32) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Other types of codes (94B60)

Recommendations

• Constacyclic additive codes over finite fields
• A partial result about the factorization conjecture for finite variable- length codes
• scientific article; zbMATH DE number 4059292
• Codes over the \(p\)-adic integers
• Generalized additive codes over Galois rings
• Codes over Gaussian integers
• Additive codes over Galois rings
• Constacyclic codes over the integers modulo \(p^{k+1}\)
• Complete variable-length ``fix-free codes
• The Galois variance of constacyclic codes

Cited in

(1)

• Two-base numeration systems

This page was built for publication: Variable-length integer codes based on the Goldbach conjecture, and other additive codes

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