On the relative profiles of a linear code and a subcode
From MaRDI portal
Publication:2248638
DOI10.1007/s10623-012-9750-yzbMath1333.94063OpenAlexW2124984118MaRDI QIDQ2248638
Yuan Luo, Zhuojun Zhuang, A. J. Han Vinck, Bin Dai
Publication date: 27 June 2014
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-012-9750-y
trellis complexitywiretap channelgeneralized Hamming weight (GHW)relative dimension/length profile (RDLP)wiretap network
Related Items (4)
The fullrank value function ⋮ Flags of almost affine codes and the two-party wire-TAP channel of type II ⋮ Partial covering arrays for data hiding and quantization ⋮ Relative profiles and extended weight polynomials of almost affine codes
Cites Work
- Unnamed Item
- Unnamed Item
- The relative generalized Hamming weight of linear \(q\)-ary codes and their subcodes
- Support weight distribution of linear codes
- The weight distribution of irreducible cyclic codes with block lengths \(n_1 ((q^\ell-1)/N)\)
- The effective length of subcodes
- Some New Characters on the Wire-Tap Channel of Type II
- Minimal trellises for block codes
- Generalized Hamming weights for linear codes
- Generalized Hamming weights of linear codes
- Efficient maximum likelihood decoding of linear block codes using a trellis
- Codes satisfying the chain condition
- Entropy/length profiles, bounds on the minimal covering of bipartite graphs, and trellis complexity of nonlinear codes
- Fundamentals of Error-Correcting Codes
- Bounds on the minimum support weights
- On the trellis complexity of certain binary linear block codes
- Dimension/length profiles and trellis complexity of linear block codes
- Lower bounds on trellis complexity of block codes
- On the Optimum Distance Profiles About Linear Block Codes
- Wire-Tap Channel II
This page was built for publication: On the relative profiles of a linear code and a subcode
