On linear projective codes which satisfy the chain condition.
From MaRDI portal
Publication:1961821
DOI10.1016/S0020-0255(99)00036-5zbMath1033.94011OpenAlexW2013820649MaRDI QIDQ1961821
Sylvia B. Encheva, Gérard D. Cohen
Publication date: 30 January 2000
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0255(99)00036-5
Cites Work
- Unnamed Item
- Uniqueness of some linear subcodes of the extended binary Golay code
- On the \([28,7,12\) binary self-complementary codes and their residuals]
- On codes satisfying the double chain condition
- Weights of linear codes and strongly regular normed spaces
- On the uniqueness resp. Nonexistence of certain codes meeting the Griesmer bound
- Generalized Hamming weights for linear codes
- Generalized Hamming weights of linear codes
- On the generalized Hamming weights of product codes
- Generalized Hamming weights of q-ary Reed-Muller codes
- Dimension/length profiles and trellis complexity of linear block codes
- On binary linear codes which satisfy the two-way chain condition
- A Bound for Error-Correcting Codes
This page was built for publication: On linear projective codes which satisfy the chain condition.
