The Subfield and Extended Codes of a Subclass of Optimal Three-Weight Cyclic Codes
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
1 Online-Ressource.
- Language
-
Englisch
- Bibliographic citation
-
The Subfield and Extended Codes of a Subclass of Optimal Three-Weight Cyclic Codes ; volume:85 ; number:12 ; day:25 ; month:9 ; year:2023 ; pages:3973-3995 ; date:12.2023
Algorithmica ; 85, Heft 12 (25.9.2023), 3973-3995, 12.2023
- Creator
-
Hernández, Félix
Vega, Gerardo
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-023-01173-5
- URN
-
urn:nbn:de:101:1-2024012915001942340528
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:25 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Hernández, Félix
- Vega, Gerardo
- SpringerLink (Online service)
Other Objects (12)
The b-symbol weight distributions of all semiprimitive irreducible cyclic codes
The extended coset leader weight enumerator of a twisted cubic code
Binary cyclic-gap constant weight codes with low-complexity encoding and decoding
IIFS and codes : (extended version)
Blind recognition of binary cyclic codes
Non-Projective Two-Weight Codes
Non-projective two-weight codes
Construction of two-weight codes
New distance bounds for quasi-cyclic codes
Obtaining new classes of optimal linear codes by puncturing and shortening optimal cyclic codes
Primitive idempotent tables of cyclic and constacyclic codes
Retargetable assembly code generation by bootstrapping : (extended version)
The b-symbol weight distributions of all semiprimitive irreducible cyclic codes
The extended coset leader weight enumerator of a twisted cubic code
Binary cyclic-gap constant weight codes with low-complexity encoding and decoding
IIFS and codes : (extended version)
Blind recognition of binary cyclic codes
Non-Projective Two-Weight Codes
Non-projective two-weight codes
Construction of two-weight codes
New distance bounds for quasi-cyclic codes
Obtaining new classes of optimal linear codes by puncturing and shortening optimal cyclic codes
Primitive idempotent tables of cyclic and constacyclic codes
Retargetable assembly code generation by bootstrapping : (extended version)
The b-symbol weight distributions of all semiprimitive irreducible cyclic codes
The extended coset leader weight enumerator of a twisted cubic code
Binary cyclic-gap constant weight codes with low-complexity encoding and decoding
IIFS and codes : (extended version)
Blind recognition of binary cyclic codes
Non-Projective Two-Weight Codes
Non-projective two-weight codes
Construction of two-weight codes
New distance bounds for quasi-cyclic codes
Obtaining new classes of optimal linear codes by puncturing and shortening optimal cyclic codes
Primitive idempotent tables of cyclic and constacyclic codes