Pregled bibliografske jedinice broj: 1021300
Cyclotomic Trace Codes
Cyclotomic Trace Codes // Algorithms, 12 (2019), 8; 168, 10 doi:10.3390/a12080168 (međunarodna recenzija, članak, znanstveni)
CROSBI ID: 1021300 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Cyclotomic Trace Codes
Autori
Crnković, Dean ; Švob, Andrea ; Tonchev, Vladimir
Izvornik
Algorithms (1999-4893) 12
(2019), 8;
168, 10
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
linear code ; two-weight code ; strongly regular graph ; block design
Sažetak
A generalization of Ding’s construction is proposed that employs as a defining set the collection of the sth powers (s>=2) of all nonzero elements in GF(p^m), where p>=2 is prime. Some of the resulting codes are optimal or near-optimal and include projective codes over GF(4) that give rise to optimal or near optimal quantum codes. In addition, the codes yield interesting combinatorial structures, such as strongly regular graphs and block designs.
Izvorni jezik
Engleski
Znanstvena područja
Matematika
POVEZANOST RADA
Projekti:
HRZZ-IP-2018-01-6732 - Kombinatorički objekti i kodovi (COCo) (Crnković, Dean, HRZZ ) ( CroRIS)
Ustanove:
Sveučilište u Rijeci, Fakultet za matematiku
Citiraj ovu publikaciju:
Časopis indeksira:
- Web of Science Core Collection (WoSCC)
- Emerging Sources Citation Index (ESCI)
- Scopus
