Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Construction of certain cyclic distance-preserving codes having linear-algebraic characteristics

From MaRDI portal
Publication:1299916
Jump to:navigation, search

DOI10.1023/A:1008393130864zbMath0968.94018OpenAlexW1564007276MaRDI QIDQ1299916

Agung Lukito, A. J. van Zanten

Publication date: 19 September 2001

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008393130864


zbMATH Keywords

Gray codecircuit codescyclic difference-preserving codescyclic distance-preserving codes


Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Cyclic codes (94B15)


Related Items (4)

Cyclic distance-preserving codes on a constant-weight basis ⋮ On the asymptotic order of circuit codes ⋮ Sets of disjoint snakes based on a Reed-Muller code and covering the hypercube ⋮ The maximum length of circuit codes with long bit runs and a new characterization theorem







This page was built for publication: Construction of certain cyclic distance-preserving codes having linear-algebraic characteristics

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1299916&oldid=13407303"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 10:56.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki