Respond
发表于 2025-3-27 00:59:05
10 List Decoding from ErasuresThe last two chapters presented a thorough investigation of the question of constructions of good codes, i.e. codes of high rate, which are list decodable from a very large, and essentially the “maximum” possible, fraction of errors.
无法治愈
发表于 2025-3-27 03:00:54
http://reply.papertrans.cn/59/5871/587013/587013_32.png
飞行员
发表于 2025-3-27 08:17:05
http://reply.papertrans.cn/59/5871/587013/587013_33.png
留恋
发表于 2025-3-27 11:01:09
12 Sample Applications Outside Coding TheoryWe now move on to provide a sample of some of the applications which both combinatorial and algorithmic aspects of list decoding have found in contexts outside of coding theory. As it turns out, by now there are numerous such applications to complexity theory and cryptography.
palliative-care
发表于 2025-3-27 16:57:42
13 Concluding RemarksIn this work, we have addressed several fundamental questions concerning list decoding. We began in the first part with the study of certain combinatorial aspects of list decoding, and established lower and upper bounds on the number of errors correctable via list decoding, as a function of the rate and minimum distance of the code.
Nebulous
发表于 2025-3-27 20:23:39
https://doi.org/10.1007/b104335Code; Error-correcting Code; Information; Shannon; algorithms; coding theory; complexity theory; concatenat
prodrome
发表于 2025-3-27 22:03:46
http://reply.papertrans.cn/59/5871/587013/587013_37.png
骚扰
发表于 2025-3-28 05:19:54
http://reply.papertrans.cn/59/5871/587013/587013_38.png
斥责
发表于 2025-3-28 08:42:12
2 Preliminaries and Monograph Structure the fundamental code families and constructions that will be dealt with and used in this book. Finally, we discuss the structure of this work and the main results which are established in the technical chapters that follow, explaining in greater detail how the results of the various chapters fit together.
恭维
发表于 2025-3-28 10:46:54
5 List Decodability Vs. Ratereater than d/2). On the other hand, we have seen that, in general, the list decoding radius (for polynomial-sized lists), purely as a function of the distance of the code, cannot be larger than the Johnson radius.