Jump to content

Zigzag code

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by David Eppstein (talk | contribs) at 07:20, 26 July 2008 (cat). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

An editor has nominated this article for deletion.
You are welcome to participate in the deletion discussion, which will decide whether or not to retain it.

Feel free to improve the article, but do not remove this notice before the discussion is closed. For more information, see the guide to deletion.
Find sources: "Zigzag code" – news · newspapers · books · scholar · JSTOR

This article may be confusing or unclear to readers. Please help clarify the article. There might be a discussion about this on the talk page. (January 2008) (Learn how and when to remove this message)

This article needs attention from an expert on the subject. Please add a reason or a talk parameter to this template to explain the issue with the article.
When placing this tag, consider associating this request with a WikiProject. (January 2008)

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 $p(1)=d(1,1)\oplus d(1,2)\oplus d(1,3)$ , where $\oplus$ 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.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Zigzag_code&oldid=227972655"

Hidden categories: