On efficient balanced codes
Pages 245 - 248
Abstract
Balanced codes have the property that no codeword is “contained” in another. This property makes balanced codes attractive for certain applications, such as the encoding of unchangeable data on a laser disk. Donald E. Knuth [1] described a balanced code with 2p information bits and p parity bits, for which serial encoding and decoding is especially efficient. In order to encode and decode efficiently, he constructed a suitable mapping for p = 8. The purpose of this paper is to construct a similar mapping for every p.
References
[1]
Donald E.Knuth,Efficient balanced codes, IEEE Transaction on Information Theory,vol.IT-32(1986) 51-53.
[2]
E.L.Leiss,Data integrity .in digital optical disks, IEEE Transaction on Computer,vol. C-33(1984) 818-827.
Index Terms
- On efficient balanced codes
Recommendations
Design of some new efficient balanced codes
A balanced code with r check bits and k information bits is a binary code of length k+r and cardinality 2k such that each codeword is balanced; that is, it has [(k+r)/2] 1's and [(k+r)/2] 0's. This paper contains new methods to construct efficient ...
Very efficient variable-length codes for the lossless compression of VQ indices
In this paper, we propose a novel compression method that can efficiently compress a vector quantization (VQ) index table. Before compressing the VQ index table, the method sorts all of the codewords in the VQ codebook by principal component analysis (...
Comments
Information & Contributors
Information
Published In
Copyright © 1987 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 February 1987
Check for updates
Qualifiers
- Article
Conference
ICMI05
Sponsor:
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 176Total Downloads
- Downloads (Last 12 months)14
- Downloads (Last 6 weeks)3
Reflects downloads up to 23 Dec 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in