Thumbnail
Access Restriction
Subscribed

Author Savari, S.A. ♦ Kliewer, J.
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©2010
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Error correction codes ♦ Hamming weight ♦ Resilience ♦ Data compression ♦ Automata ♦ Channel coding ♦ Hamming distance ♦ Sufficient conditions ♦ Dynamic programming ♦ Binary trees
Abstract We introduce a family of binary prefix condition codes in which each codeword is required to have a Hamming weight which is a multiple of w for some integer w≫=2. Such codes have intrinsic error resilience and are a special case of codes with codewords constrained to belong to a language accepted by a deterministic finite automaton. For a given source over n symbols and parameter w we offer an algorithm to construct a minimum-redundancy code among this class of prefix condition codes which has a running time of O(n^{w+2}).
ISBN 9781424464258
ISSN 10680314
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research ♦ Reading
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2010-03-24
Publisher Place USA
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
e-ISBN 9781424464265
Size (in Bytes) 195.31 kB
Page Count 10
Starting Page 327
Ending Page 336


Source: IEEE Xplore Digital Library