Zigzag code
From Wikipedia, the free encyclopedia
| All or part of this article may be confusing or unclear. Please help clarify the article. Suggestions may be on the talk page. (January 2008) |
| Please help improve this article or section by expanding it. Further information might be found on the talk page or at requests for expansion. (January 2008) |
| This article or section is in need of attention from an expert on the subject. Please help recruit one or improve this article yourself. See the talk page for details. Please consider using {{Expert-subject}} to associate this request with a WikiProject |
Zigzag code is a simple linear error-correcting code [1]. It can be described graphically as it is shown on the picture. Green nodes d(i,j) represent data bits (information to be encoded). Yellow circles p(i) are the parity bits. For example
, where
denotes modulo-2 addition.
- ^ Li Ping, "Zigzag codes and concatenated zigzag codes", IEEE Trans. Inform. Theory, special issue on codes on graphs, vol., IT-47, no. 2, pp., 800-807, Feb. 2001.

