Optimal Binary Coding of Ordered Numbers

DOI10.1137/0113026zbMATH Open0137.13603OpenAlexW2026346032MaRDI QIDQ5510068FDOQ5510068

Authors: Ken Steiglitz, Arthur Bernstein 

Publication date: 1965

Published in: Journal of the Society for Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0113026

Recommendations

• Optimal Numberings of an $N \times N$ Array
• scientific article; zbMATH DE number 515901
• Optimum '1'-ended binary prefix codes
• scientific article; zbMATH DE number 4063000
• On the minimum average distance of binary codes: Linear programming approach

zbMATH Keywords

optimal binary coding of ordered numbers

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cited In (7)

• Title not available (Why is that?)
• Optimal Numberings of an $N \times N$ Array
• Encoding Nearest Larger Values
• Efficiency of chain codes to represent binary objects
• Optimal left-to-right binary signed-digit recoding
• Title not available (Why is that?)
• The Fourier entropy-influence conjecture for certain classes of Boolean functions

This page was built for publication: Optimal Binary Coding of Ordered Numbers

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