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
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/09720529.2005.10698052 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1994176074 / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

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
    0 references
    0 references
    6 April 2006
    0 references
    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
    0 references