Bit-Wise Unequal Error Protection for Variable-Length Block Codes With Feedback

DOI10.1109/TIT.2012.2227671zbMATH Open1364.94618arXiv1101.1934OpenAlexW3101139173MaRDI QIDQ2989359FDOQ2989359

Authors: B. Nakiboğlu, Siva K. Gorantla, Lizhong Zheng, Todd Coleman 

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: The bit-wise unequal error protection problem, for the case when the number of groups of bits $ell$ is fixed, is considered for variable length block codes with feedback. An encoding scheme based on fixed length block codes with erasures is used to establish inner bounds to the achievable performance for finite expected decoding time. A new technique for bounding the performance of variable length block codes is used to establish outer bounds to the performance for a given expected decoding time. The inner and the outer bounds match one another asymptotically and characterize the achievable region of rate-exponent vectors, completely. The single message message-wise unequal error protection problem for variable length block codes with feedback is also solved as a necessary step on the way.

Full work available at URL: https://arxiv.org/abs/1101.1934

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

This page was built for publication: Bit-Wise Unequal Error Protection for Variable-Length Block Codes With Feedback

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989359)