On codes having no finite completion (Q4763927): Difference between revisions

From MaRDI portal
Added link to MaRDI 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 / OpenAlex ID
 
Property / OpenAlex ID: W1536222145 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3714479 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On completion of codes with finite deciphering delay / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of a family of finite maximal codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3700856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Each regular code is included in a maximal regular code / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5764949 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3853827 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5533188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On codes having no finite completions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completing codes / rank
 
Normal rank

Latest revision as of 13:13, 23 May 2024

scientific article; zbMATH DE number 749718
Language Label Description Also known as
English
On codes having no finite completion
scientific article; zbMATH DE number 749718

    Statements

    On codes having no finite completion (English)
    0 references
    0 references
    22 May 1995
    0 references
    maximal code
    0 references
    variable length codes
    0 references
    incompletable codes
    0 references
    binary alphabet
    0 references

    Identifiers