Code constructions and existence bounds for relative generalized Hamming weight

DOI10.1007/s10623-012-9657-7zbMath1283.94149OpenAlexW2079443739MaRDI QIDQ369440

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

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

Related Items (2)

Relative generalized Hamming weights of cyclic codes ⋮ Further results on higher weights of codes over finite rings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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)\)
• Some New Characters on the Wire-Tap Channel of Type II
• Generalized Hamming weights for linear codes
• Generalized Hamming weights of linear codes
• On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes
• Efficient maximum likelihood decoding of linear block codes using a trellis
• Codes satisfying the chain condition
• Fundamentals of Error-Correcting Codes
• Bounds on the minimum support weights
• Dimension/length profiles and trellis complexity of linear block codes
• Upper bounds on generalized distances
• The worst case probability of undetected error for linear codes on the local binomial channel
• Geometric approach to higher weights
• Wire-Tap Channel II

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