Name
Title | ||
|---|---|---|
On Optimal Finite-length Binary Codes of Four Codewords for Binary Symmetric Channels |
Abstract | ||
|---|---|---|
Finite-length binary codes of four codewords are studied for memoryless binary symmetric channels (BSCs) with the maximum likelihood decoding. For any block-length, best linear codes of four codewords have been explicitly characterized, but whether linear codes are better than nonlinear codes or not is unknown in general. In this paper, we show that for any block-length, there exists an optimal code of four codewords that is either linear or in a subset of nonlinear codes, called Class-I codes. Based on the analysis of Class-I codes, we derive sufficient conditions such that linear codes are optimal. For block-length less than or equal to 8, our analytical results show that linear codes are optimal. For block-length up to 300, numerical evaluations show that linear codes are optimal. |
Year | Venue | Keywords |
|---|---|---|
2020 | 2020 International Symposium on Information Theory and Its Applications (ISITA) | optimal finite-length binary codes,codewords,memoryless binary symmetric channels,block-length,linear codes,nonlinear codes,optimal code,Class-I codes |
DocType | ISSN | ISBN |
Conference | 2689-5838 | 978-1-7281-2855-9 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dong Yanyan | 1 | 0 | 0.34 |
| Shenghao Yang | 2 | 33 | 13.84 |