A defect property of codes with unbounded delays (Q1113876): 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: Q4430300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur le théorème du defaut / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the defect theorem and simplifiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On three-element codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A property of three-element codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The decidability of the dol prefix problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4140407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3948608 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:28, 19 June 2024

scientific article
Language Label Description Also known as
English
A defect property of codes with unbounded delays
scientific article

    Statements

    A defect property of codes with unbounded delays (English)
    0 references
    0 references
    1988
    0 references
    We show that if the code C with n words has unbounded delay in both directions then there exist n-2 words such that the words of C are products of these words. Some other conditions which guarantee the same property are given.
    0 references
    0 references
    formal language
    0 references
    code
    0 references
    unbounded delay
    0 references