Ternary codes from the strongly regular \((45, 12, 3, 3)\) graphs and orbit matrices of 2-\((45, 12, 3)\) designs (Q456889): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / review text
 
The paper describes the computational results of linear ternary codes spanned by adjacency matrices of strongly regular graphs with parameters (45, 12, 3, 3), as well as codes having as generator matrices orbit matrices of such graphs with respect to a given automorphism group. Several optimal or nearly optimal codes are found. Some of the codes are shown to admit majority-logic decoding.
Property / review text: The paper describes the computational results of linear ternary codes spanned by adjacency matrices of strongly regular graphs with parameters (45, 12, 3, 3), as well as codes having as generator matrices orbit matrices of such graphs with respect to a given automorphism group. Several optimal or nearly optimal codes are found. Some of the codes are shown to admit majority-logic decoding. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Vladimir D. Tonchev / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 94B25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05E30 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C50 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 20B25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6094167 / rank
 
Normal rank
Property / zbMATH Keywords
 
linear ternary code
Property / zbMATH Keywords: linear ternary code / rank
 
Normal rank
Property / zbMATH Keywords
 
combinatorial design
Property / zbMATH Keywords: combinatorial design / rank
 
Normal rank
Property / zbMATH Keywords
 
strongly regular graph
Property / zbMATH Keywords: strongly regular graph / rank
 
Normal rank

Revision as of 11:51, 30 June 2023

scientific article
Language Label Description Also known as
English
Ternary codes from the strongly regular \((45, 12, 3, 3)\) graphs and orbit matrices of 2-\((45, 12, 3)\) designs
scientific article

    Statements

    Ternary codes from the strongly regular \((45, 12, 3, 3)\) graphs and orbit matrices of 2-\((45, 12, 3)\) designs (English)
    0 references
    0 references
    0 references
    0 references
    16 October 2012
    0 references
    The paper describes the computational results of linear ternary codes spanned by adjacency matrices of strongly regular graphs with parameters (45, 12, 3, 3), as well as codes having as generator matrices orbit matrices of such graphs with respect to a given automorphism group. Several optimal or nearly optimal codes are found. Some of the codes are shown to admit majority-logic decoding.
    0 references
    linear ternary code
    0 references
    combinatorial design
    0 references
    strongly regular graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references