A method for efficiently computing the number of codewords of fixed weights in linear codes

DOI10.1016/j.dam.2008.01.003zbMath1156.94432OpenAlexW2018124973MaRDI QIDQ1005242

Valentin P. Bakoev, Iliya G. Bouyukliev

Publication date: 9 March 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.01.003

zbMATH Keywords

linear codecodewords generatingminimum distance algorithmweight spectrum algorithm

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Software, source code, etc. for problems pertaining to information and communication theory (94-04)

Related Items (4)

Characteristic vector and weight distribution of a linear code ⋮ A method for efficiently computing the number of codewords of fixed weights in linear codes ⋮ Схема разделения секрета типа схемы Блэкли, основанная на пересечении подпространств ⋮ Efficient representation of binary nonlinear codes: constructions and minimum distance computation

Uses Software

• Magma
• GUAVA
• Q-extension

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A method for efficiently computing the number of codewords of fixed weights in linear codes
• \(q\)-ary Gray codes and weight distributions
• A probabilistic algorithm for computing minimum weights of large error-correcting codes
• On the inherent intractability of certain coding problems (Corresp.)
• Optimal linear codes of dimension 4 over F/sub 5/
• The intractability of computing the minimum distance of a code
• Extremal self-dual codes with an automorphism of order 2
• Some new extremal self-dual codes with lengths 44, 50, 54, and 58
• Optimal quaternary linear codes of dimension five

This page was built for publication: A method for efficiently computing the number of codewords of fixed weights in linear codes