2014
DOI: 10.1007/s00200-014-0233-4
|View full text |Cite
|
Sign up to set email alerts
|

Ternary codes from some reflexive uniform subset graphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(1 citation statement)
references
References 7 publications
0
1
0
Order By: Relevance
“…For reflexive graphs whose codes possess these properties and which are related to strongly regular graphs, see [33] for the binary codes from the strongly regular graph related to the Conway group Co 2 , [34] for the binary codes of the strongly regular graph related to the simple group Ru of Rudvalis, and [35] for the ternary codes of the complement of the Higman-Sims graph. Other classes of reflexive graphs also yielded interesting codes, see for example [21,22] for the study of the binary and ternary codes from reflexive uniform subset graphs on the 3-element subsets of a set of size n.…”
Section: Introductionmentioning
confidence: 99%
“…For reflexive graphs whose codes possess these properties and which are related to strongly regular graphs, see [33] for the binary codes from the strongly regular graph related to the Conway group Co 2 , [34] for the binary codes of the strongly regular graph related to the simple group Ru of Rudvalis, and [35] for the ternary codes of the complement of the Higman-Sims graph. Other classes of reflexive graphs also yielded interesting codes, see for example [21,22] for the study of the binary and ternary codes from reflexive uniform subset graphs on the 3-element subsets of a set of size n.…”
Section: Introductionmentioning
confidence: 99%