Dimension/length profiles and trellis complexity of linear block codes
From MaRDI portal
Publication:4850277
DOI10.1109/18.340452zbMath0826.94019OpenAlexW2097117337MaRDI QIDQ4850277
Publication date: 4 December 1995
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.340452
Linear codes (general theory) (94B05) Combined modulation schemes (including trellis codes) in coding theory (94B12) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01)
Related Items
Higher Hamming weights for locally recoverable codes on algebraic curves, Finite projective geometries and classification of the weight hierarchies of codes. I, Generalized Hamming weights of three classes of linear codes, The weight hierarchy of a family of cyclic codes with arbitrary number of nonzeroes, Code constructions and existence bounds for relative generalized Hamming weight, On codes satisfying the double chain condition, The weight hierarchies of \(q\)-ary linear codes of dimension 4, Relative generalized Hamming weights of cyclic codes, A Method of Protected Distribution of Data Among Unreliable and Untrusted Nodes, Notes on generalized Hamming weights of some classes of binary codes, On linear projective codes which satisfy the chain condition., The “Art of Trellis Decoding” Is NP-Hard, Value functions and two classes of binary codes, On trellis structures for Reed-Muller codes, Harder-Narasimhan theory for linear codes (with an appendix on Riemann-Roch theory), Generalizations of the Griesmer bound, On the relative profiles of a linear code and a subcode, Weight hierarchies of linear codes of dimension 3, Radon transforms and packings, The generalization of some trellis properties of linear codes to group codes, On some classes of codes with a few weights, Subspace subcodes of generalized Reed-Solomon codes, The \(t\)-wise intersection and trellis of relative four-weight codes, Схема разделения секрета типа схемы Блэкли, основанная на пересечении подпространств, Goppa-like bounds for the generalized Feng-Rao distances., A lower bound on the weight hierarchies of product codes., Theory of supports for linear codes endowed with the sum-rank metric, Relative profiles and extended weight polynomials of almost affine codes, Error detection capability of shortened Hamming codes and their dual codes., Projective codes which satisfy the chain condition, On relative constant-weight codes, Further results on higher weights of codes over finite rings
