Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 1498821

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

zbMATH Open0951.94011MaRDI QIDQ4501012FDOQ4501012


Authors: Yuri Borissov, Nikolai L. Manev Edit this on Wikidata


Publication date: 3 September 2000



Title of this publication is not available (Why is that?)



Recommendations

  • scientific article; zbMATH DE number 2143618
  • scientific article; zbMATH DE number 1188986
  • On the weight distribution of some minimal codes
  • An inductive construction of minimal codes


zbMATH Keywords

cyclic codesminimal codewords


Mathematics Subject Classification ID

Cryptography (94A60) Linear codes (general theory) (94B05) Cyclic codes (94B15)



Cited In (12)

  • Some minimal cyclic codes over finite fields
  • Minimal cyclic codes of length 2p^n
  • Title not available (Why is that?)
  • Title not available (Why is that?)
  • Title not available (Why is that?)
  • Linear intersecting codes
  • Minimal cyclic codes of length \(2p^n\)
  • Title not available (Why is that?)
  • Cycle representatives for minimal cyclic codes (Corresp.)
  • Several classes of optimal \(p\)-ary cyclic codes with minimum distance four
  • The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes
  • On the non-minimality of the largest weight codewords in the binary Reed-Muller codes





This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501012)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4501012&oldid=18592147"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 February 2024, at 07:49. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki