Λεπτομέρειες βιβλιογραφικής εγγραφής
| Τίτλος: |
New Results and Bounds on Codes over GF(19) |
| Συγγραφείς: |
Raj Pandey, Saurav, Aydin, Nuh, Chen, Eric Z., Jönsson, Fredrik, Klonowska, Kamilla |
| Συνεισφορές: |
Kristianstad University, Faculty of Natural Science, Högskolan Kristianstad, Fakulteten för naturvetenskap, Originator, Kristianstad University, Faculty of Natural Science, Research environment of Computer science, Högskolan Kristianstad, Fakulteten för naturvetenskap, Research environment of Computer science, Originator, Kristianstad University, Faculty of Natural Science, Department of Computer Science, Högskolan Kristianstad, Fakulteten för naturvetenskap, Avdelningen för datavetenskap, Originator |
| Πηγή: |
Journal of Algebra Combinatorics Discrete Structures and Applications. 12(3):197-207 |
| Θεματικοί όροι: |
Natural sciences (1), Computer and Information Sciences (102), Naturvetenskap (1), Data- och informationsvetenskap (102) |
| Περιγραφή: |
Explicit construction of linear codes over finite fields is one of the most important and challenging problems in coding theory. Due to the centrality of this problem, databases of best-known linear codes (BKLCs) over small finite fields have been available. Recently, new databases for BKLCs over larger alphabets have been introduced. In this work, a new database of BKLCs over the field GF(19) is introduced, containing lower and upper bounds on the minimum distances for codes with lengths up to 150 and dimensions between 3 and 6. Computer searches were conducted on cyclic, constacyclic, quasi-cyclic, and quasi-twisted codes to establish lower bounds. These searches resulted in many new linear codes over GF(19). |
| Περιγραφή αρχείου: |
electronic |
| Σύνδεσμος πρόσβασης: |
https://researchportal.hkr.se/ws/files/98365316/361-Article_Text-2008-2-10-20250831.pdf |
| Βάση Δεδομένων: |
SwePub |