2025-02-23T00:48:36-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: Query fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22oai%3Aojs.admjournal.luguniv.edu.ua%3Aarticle-861%22&qt=morelikethis&rows=5
2025-02-23T00:48:36-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: => GET http://localhost:8983/solr/biblio/select?fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22oai%3Aojs.admjournal.luguniv.edu.ua%3Aarticle-861%22&qt=morelikethis&rows=5
2025-02-23T00:48:36-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-23T00:48:36-05:00 DEBUG: Deserialized SOLR response
On semisimple algebra codes: generator theory
The class of affine variety codes is defined as the \(\mathbb F_q\) linear subspaces of \(\mathcal A\) a \(\mathbb F_q\)-semisimple algebra, where \(\mathbb F_q\) is the finite field with \(q=p^r\) elements and characteristic \(p\). It seems natural to impose to the code some extra structure such as...
Saved in:
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
Lugansk National Taras Shevchenko University
2018
|
Subjects: | |
Online Access: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/861 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | The class of affine variety codes is defined as the \(\mathbb F_q\) linear subspaces of \(\mathcal A\) a \(\mathbb F_q\)-semisimple algebra, where \(\mathbb F_q\) is the finite field with \(q=p^r\) elements and characteristic \(p\). It seems natural to impose to the code some extra structure such as been a subalgebra of \(\mathcal A\). In this case we will have codes that have a Mattson-Solomon transform treatment as the classical cyclic codes. Moreover, the results on the structure of semisimple finite dimensional algebras allow us to study those codes from the generator point of view. |
---|