On the Second Relative Greedy Weight of 4-Dimensional Codes

DOI10.1109/TIT.2019.2911678MaRDI QIDQ5211382zbMATH OpenOpenAlexWikidataFDO

Authors Liang Bai, Zihui Liu

Publication date 28 January 2020

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2019.2911678

zbMATH Keywords

classification of 4-dimensional codescoset coding schemeoptimal codessecond relative generalized Hamming weightsecond relative greedy weightupper boundswire-tap channel of type II

Mathematics Subject Classification ID

Other types of codes (94B60) Bounds on codes (94B65)

Cited in

(4)

• Further results on the second relative greedy weight of 3-dimensional codes
• On the second greedy weight for linear codes satisfying the fullrank condition
• On the second relative greedy weight
• Fourth moments of the code-weights

This page was built for publication: On the Second Relative Greedy Weight of 4-Dimensional Codes

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