Completely regular codes with different parameters giving the same distance-regular coset graphs (Q526258): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4079494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5707657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilinear forms over a finite field, with applications to coding theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniqueness of certain completely regular Hadamard codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completely transitive codes in Hamming graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing completely regular codes from an algebraic viewpoint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5331504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completely regular codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038772 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Completely Regular $q$-ary Codes Based on Kronecker Products / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Lifting Perfect Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completely regular codes and completely transitive codes / rank
 
Normal rank

Revision as of 19:27, 13 July 2024

scientific article
Language Label Description Also known as
English
Completely regular codes with different parameters giving the same distance-regular coset graphs
scientific article

    Statements

    Completely regular codes with different parameters giving the same distance-regular coset graphs (English)
    0 references
    10 May 2017
    0 references
    bilinear forms graph
    0 references
    completely regular code
    0 references
    completely transitive code
    0 references
    coset graph
    0 references
    distance-regular graph
    0 references
    distance-transitive graph
    0 references
    Kronecker product construction
    0 references
    lifting of a field
    0 references
    uniformly packed code
    0 references
    0 references
    0 references

    Identifiers