Random generation of linear codes.

DOI10.1007/S000100050107zbMATH Open1054.94014OpenAlexW2116192162MaRDI QIDQ1306343FDOQ1306343

Authors: Harald Fripertinger 

Publication date: 1999

Published in: Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s000100050107

Recommendations

• Enumeration, construction and random generation of block codes
• scientific article; zbMATH DE number 767675
• What is Q-extension
• A method for efficiently computing the number of codewords of fixed weights in linear codes
• scientific article; zbMATH DE number 7434637
• Classifying subspaces of Hamming spaces
• Upper bounds on permutation codes via linear programming
• scientific article; zbMATH DE number 1057748
• Characteristic vector and weight distribution of a linear code
• The program \textsc{Generation} in the software package \textsc{QextNewEdition}

zbMATH Keywords

linear codesgroup actionsrandom generationisometry classes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cited In (2)

• Title not available (Why is that?)
• Random matrix theory over finite fields

Uses Software

• SYMMETRICA

This page was built for publication: Random generation of linear codes.

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