@inproceedings{d221fa3d573a455ea8e0225847d6daa0,
title = "Computationally Efficient Codes for Strongly Dobrushin-Stambler Nonsymmetrizable Oblivious AVCs",
abstract = "We propose a concatenated code construction for a class of discrete-alphabet oblivious arbitrarily varying channels (AVCs) with cost constraints. The code has time and space complexity polynomial in the blocklength n. It uses a Reed-Solomon outer code, logarithmic blocklength random inner codes, and stochastic encoding by permuting the codeword before transmission. When the channel satisfies a condition called strong DS-nonsymmetrizability (a modified version of nonsymmetrizability originally due to Dobrushin and Stambler), we show that the code achieves a rate that for a variety of oblivious AVCs (such as classically studied error/erasure channels) match the known capacities.",
author = "Dey, \{B. K.\} and S. Jaggi and M. Langberg and Sarwate, \{A. D.\} and Y. Zhang",
note = "Publisher Copyright: {\textcopyright} 2024 IEEE.; 2024 IEEE International Symposium on Information Theory, ISIT 2024 ; Conference date: 07-07-2024 Through 12-07-2024",
year = "2024",
doi = "10.1109/ISIT57864.2024.10619362",
language = "English",
series = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "1586--1591",
booktitle = "2024 IEEE International Symposium on Information Theory, ISIT 2024 - Proceedings",
address = "United States",
}