Content deleted Content added
Henk.muller (talk | contribs) |
m using discuss= in merge template (for syntax standardization) |
||
Line 1:
{{Mergefrom|M of n codes|discuss=Talk:M of n codes|date=April 2008}}
In [[coding theory]], a '''constant-weight code''' is an [[error detection and correction]] code where all codewords share the same [[Hamming weight]]. The theory is closely connected to that of [[Combinatorial design|designs]] (such as [[block design|''t''-design]]s and [[Steiner system]]s) and has several applications, including [[Frequency-hopping spread spectrum|frequency hopping]] in [[Global System for Mobile Communications|GSM]] networks.<ref name="smith">D. H. Smith, L. A. Hughes and S. Perkins (2006). "[http://www.combinatorics.org/Volume_13/Abstracts/v13i1a2.html A New Table of Constant Weight Codes of Length Greater than 28]". ''The Electronic Journal of Combinatorics'' '''13'''.</ref> Most of the work on this very vital field of [[discrete mathematics]] is concerned with ''binary'' constant-weight codes. In addition to use as error correction codes, the large space between code words can also be used in the design of asynchronous and delay insensitive circuits,
| |||