Variable Length Perfect Codes

DOI10.1080/02522667.1992.10699099MaRDI QIDQ4008477zbMATH OpenOpenAlexFDO

Authors Margaret Ann Bernard, Bhudev Sharma

Publication date 27 September 1992

Published in Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02522667.1992.10699099

zbMATH Keywords

\(e\)-errorsHamming sphere packing boundvariable-length perfect codes

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45)

Recommendations

• scientific article; zbMATH DE number 4059292
• Perfect Codes of Length n with Kernels of Dimension $n-\log(n+1)-3$
• A lower bound on average codeword length of variable length error-correcting codes
• Constructions for variable-length error-correcting codes
• scientific article; zbMATH DE number 6516526

Cites work

• A survey of perfect codes
• scientific article; zbMATH DE number 3489011 (Why is no real title available?)
• Perfect Codes in the Lee Metric and the Packing of Polyominoes

Cited in

(7)

• A lower bound on average codeword length of variable length error-correcting codes
• scientific article; zbMATH DE number 4059292 (Why is no real title available?)
• PHASED ERROR CORRECTING PERFECT CODES
• Constructions for variable-length error-correcting codes
• Variable-length codes for error correction
• scientific article; zbMATH DE number 6765487 (Why is no real title available?)
• Variants of Wegman-Carter message authentication code supporting variable tag lengths

This page was built for publication: Variable Length Perfect Codes

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