Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/1335| Title: | Linear ternary codes of strongly regular signed graphs | Authors: | Stanić, Zoran | Keywords: | Adjacency matrix;Code dimension;Code distance;Finite field;Strong regularity;Vector space | Issue Date: | 1-Jan-2024 | Rank: | M22 | Publisher: | Elsevier | Journal: | Discrete Mathematics | Abstract: | We consider linear ternary codes generated by A+βI, where A is the adjacency matrix of a strongly regular signed graph, I is the identity matrix and β∈F3. Our results include theoretical examinations on dimension and distance, and the interplay between the codes. We also compute many structural parameters of codes for some infinite families of strongly regular signed graphs and establish more than 60 particular codes of comparatively small dimension. It occurs that some known linear ternary codes are covered by this approach. |
URI: | https://research.matf.bg.ac.rs/handle/123456789/1335 | ISSN: | 0012365X | DOI: | 10.1016/j.disc.2023.113714 | Rights: | Attribution-NonCommercial-NoDerivs 3.0 United States |
| Appears in Collections: | Research outputs |
Files in This Item:
| File | Description | Size | Format | Existing users please |
|---|---|---|---|---|
| CodesSRSGrev.pdf | 605.11 kB | Adobe PDF | Embargoed until February 1, 2026 Request a copy |
This item is licensed under a Creative Commons License
