Combinatorial properties of balanced codes over the complex<i>m</i>-th roots of unity and efficient coding algorithms (Q3379155): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Balancing sets of vectors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3105730 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient balanced codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: High-order spectral-null codes-constructions and bounds / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Design of some new efficient balanced codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient \(m\)-ary balanced codes / rank | |||
Normal rank |
Latest revision as of 12:53, 24 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Combinatorial properties of balanced codes over the complex<i>m</i>-th roots of unity and efficient coding algorithms |
scientific article |
Statements
Combinatorial properties of balanced codes over the complex<i>m</i>-th roots of unity and efficient coding algorithms (English)
0 references
6 April 2006
0 references
bipolar alphabet
0 references
\(m\)-ary alphabet
0 references
\(m\)-th roots of unity
0 references
DC-free communication
0 references
line codes
0 references