DocumentCode
3070133
Title
Closed-Form Approximation of Maximum Free Distance for Binary Block Codes
Author
Akhtman, J. ; Maunder, R. ; Bonello, N. ; Han, L.
Author_Institution
Sch. of ECS., Univ. of Southampton, Southampton, UK
fYear
2009
fDate
20-23 Sept. 2009
Firstpage
1
Lastpage
3
Abstract
We devise an analytically simple as well as invertible approximate expression, which describes the relation between the maximum free distance of a binary code and the corresponding maximum attainable code-rate. For example, for a half-rate, length-128 binary code the known bounds limit the maximum attainable free distance to 16 < d(n = 128, r = 0.5) < 32, while our solution yields d(n = 128, r = 0.5) ¿ 22. The results provided may be utilized for the design and characterization of efficient coding schemes.
Keywords
approximation theory; binary codes; block codes; binary block codes; closed-form approximation; maximum attainable code-rate; maximum free distance; Binary codes; Block codes; Entropy; Hamming distance; Real time systems; Speech coding; Upper bound; Writing;
fLanguage
English
Publisher
ieee
Conference_Titel
Vehicular Technology Conference Fall (VTC 2009-Fall), 2009 IEEE 70th
Conference_Location
Anchorage, AK
ISSN
1090-3038
Print_ISBN
978-1-4244-2514-3
Electronic_ISBN
1090-3038
Type
conf
DOI
10.1109/VETECF.2009.5378953
Filename
5378953
Link To Document