Abstract
An optimum method of coding an ensemble of messages consisting of a finite number of members is developed. A minimum-redundancy code is one constructed in such a way that the average number of coding digits per message is minimized.
Keywords
Affiliated Institutions
Related Publications
A recursive approach to low complexity codes
A method is described for constructing long error-correcting codes from one or more shorter error-correcting codes, referred to as subcodes, and a bipartite graph. A graph is sh...
New trellis codes based on lattices and cosets
A new technique is proposed for constructing trellis codes. which provides an alternative to Ungerboeck's method of "set partitioning." The new codes use a signal constellation ...
Design of balanced and constant weight codes for VLSI systems
A constant weight, w, code with k information bits and r check bits is a binary code of length n=k+r and cardinality 2/sup k/ such that the number of 1s in each code word is equ...
The art of signaling: fifty years of coding theory
In 1948 Shannon developed fundamental limits on the efficiency of communication over noisy channels. The coding theorem asserts that there are block codes with code rates arbitr...
Geometrically uniform codes
A signal space code C is defined as geometrically uniform if, for any two code sequences in C, there exists an isometry that maps one sequence into the other while leaving the c...
Publication Info
- Year
- 1952
- Type
- article
- Volume
- 40
- Issue
- 9
- Pages
- 1098-1101
- Citations
- 6175
- Access
- Closed
External Links
Social Impact
Social media, news, blog, policy document mentions
Citation Metrics
Cite This
Identifiers
- DOI
- 10.1109/jrproc.1952.273898