A three-word code which is not prefix-suffix composed (Q671357): 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.1016/0304-3975(95)00139-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2076024367 / 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: Une famille remarquable de codes indecomposables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4106058 / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:57, 27 May 2024

scientific article
Language Label Description Also known as
English
A three-word code which is not prefix-suffix composed
scientific article

    Statements

    A three-word code which is not prefix-suffix composed (English)
    0 references
    0 references
    27 February 1997
    0 references
    codes having finite completion
    0 references
    codes having no finite completion
    0 references
    finite \(p\)-\(s\)-composed codes
    0 references
    finite prefix-suffix composed code
    0 references
    \(n\)-word code
    0 references

    Identifiers