Code constructions and existence bounds for relative generalized Hamming weight

DOI10.1007/S10623-012-9657-7MaRDI QIDQ369440zbMATHOpenAlexFDO

Authors Zhuojun Zhuang, Yuan Luo, Bin Dai

Publication date 24 September 2013

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

Full work available at URL https://doi.org/10.1007/s10623-012-9657-7

zbMATH Keywords

generalized Hamming weightexistence boundrelative generalized Hamming weightTrellis complexitywiretap channel of type IIwiretap network II

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Linear codes (general theory) (94B05) Bounds on codes (94B65)

Recommendations

• The relative generalized Hamming weight of linear \(q\)-ary codes and their subcodes
• On the Relative Generalized Hamming Weights of Linear Codes and their Subcodes
• Generalized Hamming weights of linear codes
• Bounds for generalized Hamming weights of general AG codes
• Relative generalized Hamming weights of cyclic codes

Cites work

• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1181550 (Why is no real title available?)
• scientific article; zbMATH DE number 3893212 (Why is no real title available?)
• Bounds on the minimum support weights
• Codes satisfying the chain condition
• Dimension/length profiles and trellis complexity of linear block codes
• Efficient maximum likelihood decoding of linear block codes using a trellis
• Fundamentals of Error-Correcting Codes
• Generalized Hamming weights for linear codes
• Generalized Hamming weights of linear codes
• Geometric approach to higher weights
• On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes
• Some New Characters on the Wire-Tap Channel of Type II
• The relative generalized Hamming weight of linear \(q\)-ary codes and their subcodes
• The weight distribution of irreducible cyclic codes with block lengths \(n_1 ((q^\ell-1)/N)\)
• The worst case probability of undetected error for linear codes on the local binomial channel
• Upper bounds on generalized distances
• Wire-Tap Channel II

Cited in

(12)

• Bounds for generalized Hamming weights of general AG codes
• On the relative profiles of a linear code and a subcode
• Relative generalized Hamming weights of affine Cartesian codes
• New code equivalence based on relative generalized Hamming weights
• A property of the relative subcodes
• Relative generalized Hamming weights of cyclic codes
• On the Relative Generalized Hamming Weights of Linear Codes and their Subcodes
• Further results on higher weights of codes over finite rings
• On the relative generalized Hamming weights of a 4-dimensional linear code and a subcode with dimension one
• scientific article; zbMATH DE number 7691472 (Why is no real title available?)
• WOM-codes construits à partir des codes de Hamming
• Relative generalized Hamming weights and extended weight polynomials of almost affine codes

This page was built for publication: Code constructions and existence bounds for relative generalized Hamming weight

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