BibTeX
CSL-JSON
MLA
Harvard
EXTENDED SUBCLASS OF CYCLIC SEPARABLE GOPPA CODES
release_k3bmztofangxrlhml6cqehcd5u
by
Ajay Sharma,
O. P. VINOCHA
Published
in INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY
by CIRWOLRD.
2016 Volume 15, p6776-6784
Abstract
In 2013[4]a new subclass of cyclic Goppa code with Goppa polynomial of degree 2 is presented by Bezzateev and Shekhunova. They proved that this subclass contains all cyclic codes of considered length. In the present work we consider a Goppa polynomial of degree three and proved that the subclass generated by this polynomial represent a cyclic, reversible and separable Goppa code.
In application/xml+jats format
Archived Files and Locations
application/pdf
445.1 kB
file_h4ulpihzandqnltn6fdjgrq4xq
|
web.archive.org (webarchive) cirworld.com (web) |
Read Archived PDF
Preserved and Accessible
Type
Stage
Date 2016-07-30
article-journalStage
published
Date 2016-07-30
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links
oaDOI/unpaywall (OA fulltext)
Crossref Metadata (via API)
Worldcat
SHERPA/RoMEO (journal policies)
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar
Crossref Metadata (via API)
Worldcat
SHERPA/RoMEO (journal policies)
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar