Constructs infinite families of quaternary linear codes from two-generator simplicial complexes, determines Lee weight distributions, and reports at least 32 new or improved codes plus infinite families of Griesmer and minimal binary codes via Gray images.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
fields
cs.IT 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Constructs linear codes over ring S from simplicial complexes, determines parameters of Gray images and subfield-like codes, and derives families of divisible, minimal, and optimal codes with applications to few-weight codes, LRCs, and strongly regular graphs.
citing papers explorer
-
Quaternary codes with new parameters from two-generator simplicial complexes
Constructs infinite families of quaternary linear codes from two-generator simplicial complexes, determines Lee weight distributions, and reports at least 32 new or improved codes plus infinite families of Griesmer and minimal binary codes via Gray images.
-
Construction of codes over a commutative non-unital ring from simplicial complexes and their applications
Constructs linear codes over ring S from simplicial complexes, determines parameters of Gray images and subfield-like codes, and derives families of divisible, minimal, and optimal codes with applications to few-weight codes, LRCs, and strongly regular graphs.