Construction of some binary linear codes of minimum distance five

DOI10.1109/18.133262zbMATH Open0734.94016OpenAlexW2133843984MaRDI QIDQ3363236FDOQ3363236

Authors:

Publication date: 1991

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.133262

Recommendations

• scientific article; zbMATH DE number 1189040
• scientific article; zbMATH DE number 5054194
• New minimum distance bounds for linear codes over GF(5).
• An analysis of Chen's construction of minimum-distance five codes
• A Heuristic Algorithm for the Construction of Good Linear Codes

zbMATH Keywords

binary linear codesminimum Hamming distance

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cited In (11)

• Binary codes with a minimum distance of four (Corresp.)
• Title not available (Why is that?)
• Three best binary linear block codes of minimum distance fifteen
• An analysis of Chen's construction of minimum-distance five codes
• Title not available (Why is that?)
• Binary linear codes with near-extremal maximum distance
• Binary set functions and parity check matrices
• Title not available (Why is that?)
• Shortening of codes
• Construction of binary minimal product parity-check matrices
• On generalized Erdős-Ginzburg-Ziv constants for \(\mathbb{Z}_2^d\)

This page was built for publication: Construction of some binary linear codes of minimum distance five

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