The depth distribution-a new characterization for linear codes
From MaRDI portal
Publication:4345645
DOI10.1109/18.605610zbMath0878.94052OpenAlexW2109293347MaRDI QIDQ4345645
Publication date: 23 July 1997
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/df257954ca1ace0956bda4a55c71d7a5decce0dc
linear codesbinary codesHamming codeself-dual codesgenerator matrixdepth distributionextended Hamming codefirst-order Reed-Muller codedepth-equivalence
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)
Related Items (7)
Roulette games and depths of words over finite commutative rings ⋮ Graphs with the unique path property: Structure, cycles, factors, and constructions ⋮ The depth spectrums of constacyclic codes over finite chain rings ⋮ Sequences with good correlation property based on depth and interleaving techniques ⋮ On the depth spectrum of binary linear codes and their dual ⋮ On the depth spectrum of repeated-root constacyclic codes over finite chain rings ⋮ The depth spectrum of negacyclic codes over \(\mathbb{Z}_4\)
This page was built for publication: The depth distribution-a new characterization for linear codes