Finite alphabet source recovery in polynomial systems. (Q1853425): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4693774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5690494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4143433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An OFDM interpretation of zero padded block transmissions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algebraic identifiability of finite impulse response channels driven by linearly precoded signals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4340161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete multiple tone modulation with coset coding for the spectrally shaped channel / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:24, 5 June 2024

scientific article
Language Label Description Also known as
English
Finite alphabet source recovery in polynomial systems.
scientific article

    Statements

    Finite alphabet source recovery in polynomial systems. (English)
    0 references
    0 references
    21 January 2003
    0 references
    0 references
    System identification
    0 references
    Polynomial equations
    0 references
    Decidability
    0 references
    Invertibility
    0 references