Abstract
We consider a communication model over a binary channel in which the transmitter knows which bits of the n-bit transmission are prone to loss in the channel. We call this model channel with localized erasures in analogy with localized errors studied earlier in the literature. We present two constructions of binary codes with t(1+/spl epsiv/) check bits, where t=/spl alpha/n is the maximal possible number of erasures. One construction is on-line and has encoding complexity of order n//spl epsiv//sup 4/ and decoding complexity of order n//spl epsiv//sup 2/. The other construction is recursive. The encoding/decoding algorithms assume a delay of n bits i.e. rely on the entire codeword. The encoding/decoding complexity behaves roughly as n//spl epsiv//sup 2/ and n//spl epsiv/, respectively.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
