| 词条 | Zigzag code |
| 释义 |
In coding theory, a zigzag code is a type of linear error-correcting code introduced by {{harvtxt|Ping|Huang|Phamdo|2001}}.[1] They are defined by partitioning the input data into segments of fixed size, and adding sequence of check bits to the data, where each check bit is the exclusive or of the bits in a single segment and of the previous check bit in the sequence. The code rate is high: {{math|J/(J + 1)}} where {{mvar|J}} is the number of bits per segment. Its worst-case ability to correct transmission errors is very limited: in the worst case it can only detect a single bit error and cannot correct any errors. However, it works better in the soft-decision model of decoding: its regular structure allows the task of finding a maximum-likelihood decoding or a posteriori probability decoding to be performed in constant time per input bit. References1. ^{{citation | last1 = Ping | first1 = Li | last2 = Huang | first2 = Xiaoling | last3 = Phamdo | first3 = Nam | doi = 10.1109/18.910590 | mr = 1820492 | issue = 2 | journal = IEEE Transactions on Information Theory | pages = 800–807 | title = Zigzag codes and concatenated zigzag codes | volume = 47 | year = 2001| citeseerx = 10.1.1.107.2616 }}. {{telecommunications-stub}} 2 : Coding theory|Error detection and correction |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。