|Title:||Construction of Error-Correcting DC Free Block Codes
|Abstract:||A (2n,k,l,c,d) dc free binary block code is a code of length 2n, constant weight n, 2^k codewords, maximum runlength of a symbol l, maximum accumulated charge c, and minimum distance d. The requirements are that k and d will be large and I and c small. We present a (16,9,6,3,4) dc free block code, and a (30,20,10,6,4) dc free block code. Easy encoding and decoding procedures for these codes are given. Given a code C1 of length n, even weight, and distance 4, we can obtain a (4n,k,I,c,4) dc free block code C2, where l is 4,5 or 6, c is not greater than n +1 (but usually significantly smaller). If C1 is easily constructed then C2 has easy encoding and decoding procedures.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1988/CS/CS0511), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1988
To the main CS technical reports page
Computer science department, Technion