Constant-weight code: Difference between revisions

Revision as of 00:54, 10 October 2016

Revision as of 15:21, 3 July 2017

Line 1:

In [[coding theory]], a '''constant-weight code''', also called an '''m of n code''', is an [[error detection and correction]] code where all codewords share the same [[Hamming weight]].

The [[one-hot]] code and the '''balanced code''' are two widely used kinds of constant-weight code.

Line 23 ⟶ 22:

| title=System-on-Chip Design using Self-timed Networks-on-Chip

| url=http://www.design-reuse.com/articles/14561/system-on-chip-design-using-self-timed-networks-on-chip.html

| authorsauthor=W.J. Bainbridge, A.Bardsley, R.W.McGuffin

| author2=A. Bardsley

| author3=R.W. McGuffin

}}</ref> used in delay insensitive circuits. For these codes, <math>n=N,~ d=2,~ w=1</math> and <math>A(n, d, w) = n</math>.

Line 40 ⟶ 41:

[[6b/8b encoding]] uses a 4 of 8 code;

the [[Hadamard code]] is a <math>2^k/2</math> of <math>2^k</math> code (except for the zero codeword),

the [[IEEE 1355#Slice: TS-FO-02 | three of six]] code;

etc.

Line 83 ⟶ 84:

<!--See http://en.wikipedia.org/wiki/Wikipedia:Footnotes for an explanation of how to generate footnotes using the <ref> and </ref> tags and the tag below -->

{{reflist}}

== External links ==

Line 91:

[[Category:Information theory]]

[[Category:Error detection and correction]]

{{telecommunications-stub}}