On the public citation graph

On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes

0 signed · 144 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1109/18.133259openalex-snapshot
Generalized Hamming weights for linear codes
inferredcites →https://doi.org/10.1109/18.21228openalex-snapshot
Minimal trellises for block codes
inferredcites →https://doi.org/10.1109/18.21246openalex-snapshot
Coset codes. II. Binary lattices and related codes
inferredcites →https://doi.org/10.1109/18.256515openalex-snapshot
On complexity of trellis structure of linear block codes
inferredcites →https://doi.org/10.2307/2284618openalex-snapshot
Combinatorial Mathematics and Its Applications.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/047085474xopenalex-snapshot
Turbo Coding, Turbo Equalisation and Space‐Time Coding
inferred← citeshttps://doi.org/10.1002/0471667846openalex-snapshot
Trellis and Turbo Coding
inferred← citeshttps://doi.org/10.1002/9780470978481.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1002/9781118576618.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1002/9781119106319.ch4openalex-snapshot
Trellis Representations
inferred← citeshttps://doi.org/10.1006/ffta.1999.0265openalex-snapshot
On Trellis Structures for Reed–Muller Codes
inferred← citeshttps://doi.org/10.1007/3-540-44828-4_24openalex-snapshot
On g-th MDS Codes and Matroids
inferred← citeshttps://doi.org/10.1007/3-540-45624-4_10openalex-snapshot
Duality and Greedy Weights of Linear Codes and Projective Multisets
inferred← citeshttps://doi.org/10.1007/3-540-46796-3_43openalex-snapshot
On the State Complexities of Ternary Codes
inferred← citeshttps://doi.org/10.1007/3-540-57843-9_28openalex-snapshot
Bounds on generalized weights
inferred← citeshttps://doi.org/10.1007/3-540-63163-1_7openalex-snapshot
On repeated-root cyclic codes and the two-way chain condition
inferred← citeshttps://doi.org/10.1007/bfb0025140openalex-snapshot
Non-minimal trellises for linear block codes
inferred← citeshttps://doi.org/10.1007/s002000050075openalex-snapshot
Bounds on the Weight Hierarchies of Extremal Non-chain Codes of Dimension 4
inferred← citeshttps://doi.org/10.1007/s002000050119openalex-snapshot
The Minimal Generator Matrix of a Vector Space
inferred← citeshttps://doi.org/10.1007/s10114-004-0337-zopenalex-snapshot
Finite Projective Geometries and Classification of the Weight Hierarchies of Codes (I)
inferred← citeshttps://doi.org/10.1007/s10623-003-6152-1openalex-snapshot
Support Weight Enumerators and Coset Weight Distributions of Isodual Codes
inferred← citeshttps://doi.org/10.1007/s10623-011-9597-7openalex-snapshot
Moments of the support weight distribution of linear codes
inferred← citeshttps://doi.org/10.1007/s10623-012-9657-7openalex-snapshot
Code constructions and existence bounds for relative generalized Hamming weight
inferred← citeshttps://doi.org/10.1007/s10623-024-01553-0openalex-snapshot
The weight hierarchies of three classes of linear codes
inferred← citeshttps://doi.org/10.1007/s10623-025-01747-0openalex-snapshot
Some three-weight linear codes and their complete weight enumerators and weight hierarchies
inferred← citeshttps://doi.org/10.1007/s10623-025-01758-xopenalex-snapshot
The weight distributions and weight hierarchies of two classes of few-weight linear codes
inferred← citeshttps://doi.org/10.1007/s10623-026-01889-9openalex-snapshot
Generalized Hamming weights of additive codes and geometric counterparts
inferred← citeshttps://doi.org/10.1016/j.disc.2010.08.018openalex-snapshot
The weight hierarchies of q -ary linear codes of dimension 4
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114240openalex-snapshot
The weight hierarchies of linear codes from simplicial complexes
inferred← citeshttps://doi.org/10.1016/j.ffa.2016.03.004openalex-snapshot
Higher Hamming weights for locally recoverable codes on algebraic curves
inferred← citeshttps://doi.org/10.1016/j.ffa.2017.01.002openalex-snapshot
The weight hierarchy of a family of cyclic codes with arbitrary number of nonzeroes
inferred← citeshttps://doi.org/10.1016/j.ffa.2017.12.008openalex-snapshot
Relative generalized Hamming weights of cyclic codes
inferred← citeshttps://doi.org/10.1016/j.laa.2005.07.008openalex-snapshot
Matrix characterization of linear codes with arbitrary Hamming weight hierarchy
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00116-9openalex-snapshot
On the second greedy weight for linear codes of dimension 3
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00149-5openalex-snapshot
On codes satisfying the double chain condition
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00366-4openalex-snapshot
The weight hierarchies and generalized weight spectra of the projective codes from degenerate quadrics
inferred← citeshttps://doi.org/10.1016/s0378-3758(00)00250-0openalex-snapshot
Weight hierarchies of linear codes of dimension 3
inferred← citeshttps://doi.org/10.1017/9781009067928.009openalex-snapshot
Reed–Muller Codes
inferred← citeshttps://doi.org/10.1023/a:1008225524987openalex-snapshot
Weight Hierarchies of Linear Codes Satisfying the Chain Condition
inferred← citeshttps://doi.org/10.1023/a:1008369924325openalex-snapshot
inferred← citeshttps://doi.org/10.1023/a:1011265011802openalex-snapshot
Trellis Structure and Higher Weights of Extremal Self-Dual Codes
inferred← citeshttps://doi.org/10.1049/el:19960632openalex-snapshot
Efficient permutation criterion for obtaining minimal trellis of a block code
inferred← citeshttps://doi.org/10.1049/iet-com.2019.0903openalex-snapshot
Bounds on relative generalised Hamming weight
inferred← citeshttps://doi.org/10.1080/00207160.2013.818669openalex-snapshot
Onm-MDS codes over finite fields
inferred← citeshttps://doi.org/10.1109/12.795225openalex-snapshot
Ordered binary decision diagrams and minimal trellises
inferred← citeshttps://doi.org/10.1109/18.256515openalex-snapshot
On complexity of trellis structure of linear block codes
inferred← citeshttps://doi.org/10.1109/18.259662openalex-snapshot
On the generalized Hamming weights of product codes
inferred← citeshttps://doi.org/10.1109/18.312184openalex-snapshot
Maximum-likelihood soft decision decoding of BCH codes
inferred← citeshttps://doi.org/10.1109/18.340452openalex-snapshot
Dimension/length profiles and trellis complexity of linear block codes
inferred← citeshttps://doi.org/10.1109/18.340487openalex-snapshot
Upper bounds on generalized distances
inferred← citeshttps://doi.org/10.1109/18.370171openalex-snapshot
Asymptotically good codes have infinite trellis complexity
inferred← citeshttps://doi.org/10.1109/18.370172openalex-snapshot
On the trellis complexity of certain binary linear block codes
inferred← citeshttps://doi.org/10.1109/18.391268openalex-snapshot
Trellis-oriented decomposition and trellis complexity of composite-length cyclic codes
inferred← citeshttps://doi.org/10.1109/18.412673openalex-snapshot
Linear block codes over cyclic groups
inferred← citeshttps://doi.org/10.1109/18.476317openalex-snapshot
On the trellis structure of block codes
inferred← citeshttps://doi.org/10.1109/18.476318openalex-snapshot
Lower bounds on trellis complexity of block codes
inferred← citeshttps://doi.org/10.1109/18.476337openalex-snapshot
On bit-level trellis complexity of Reed-Muller codes
inferred← citeshttps://doi.org/10.1109/18.490504openalex-snapshot
Optimal sectionalization of a trellis
inferred← citeshttps://doi.org/10.1109/18.490573openalex-snapshot
On binary linear codes which satisfy the two-way chain condition
inferred← citeshttps://doi.org/10.1109/18.508834openalex-snapshot
On the BCJR trellis for linear block codes
inferred← citeshttps://doi.org/10.1109/18.532915openalex-snapshot
Bounds on the weight hierarchy of generalized concatenated codes
inferred← citeshttps://doi.org/10.1109/18.556112openalex-snapshot
On the information function of an error-correcting code
inferred← citeshttps://doi.org/10.1109/18.556621openalex-snapshot
The weight hierarchies of q-ary codes of dimension 4
inferred← citeshttps://doi.org/10.1109/18.556665openalex-snapshot
Trellis decoding complexity of linear block codes
inferred← citeshttps://doi.org/10.1109/18.556675openalex-snapshot
Trellis complexity versus the coding gain of lattices. I
inferred← citeshttps://doi.org/10.1109/18.556676openalex-snapshot
Trellis complexity versus the coding gain of lattices. II
inferred← citeshttps://doi.org/10.1109/18.556699openalex-snapshot
Proof of a conjecture of McEliece regarding the expansion index of the minimal trellis
inferred← citeshttps://doi.org/10.1109/18.556701openalex-snapshot
On the intractability of permuting a block code to minimize trellis complexity
inferred← citeshttps://doi.org/10.1109/18.567718openalex-snapshot
On generalized Hamming weights of binary primitive BCH codes with minimum distance one less than a power of two
inferred← citeshttps://doi.org/10.1109/18.567719openalex-snapshot
On the generalized Hamming weights of cyclic codes
inferred← citeshttps://doi.org/10.1109/18.568717openalex-snapshot
Soft-decision decoding of binary linear block codes based on an iterative search algorithm
inferred← citeshttps://doi.org/10.1109/18.641546openalex-snapshot
Generalized Bezout's theorem and its applications in coding theory
inferred← citeshttps://doi.org/10.1109/18.641575openalex-snapshot
Bounds on the weight hierarchies of linear codes of dimension 4
inferred← citeshttps://doi.org/10.1109/18.651015openalex-snapshot
Generalized Hamming weights of q-ary Reed-Muller codes
inferred← citeshttps://doi.org/10.1109/18.651072openalex-snapshot
A sequential decoder for linear block codes with a variable bias-term metric
inferred← citeshttps://doi.org/10.1109/18.661506openalex-snapshot
Entropy/length profiles, bounds on the minimal covering of bipartite graphs, and trellis complexity of nonlinear codes
inferred← citeshttps://doi.org/10.1109/18.661515openalex-snapshot
A trellis-based recursive maximum-likelihood decoding algorithm for binary linear block codes
inferred← citeshttps://doi.org/10.1109/18.681323openalex-snapshot
Multiple-phase codes for detection without carrier phase reference
inferred← citeshttps://doi.org/10.1109/18.681330openalex-snapshot
On the trellis representation of the Delsarte-Goethals codes
inferred← citeshttps://doi.org/10.1109/18.746811openalex-snapshot
Weight hierarchies of extremal non-chain binary codes of dimension 4
inferred← citeshttps://doi.org/10.1109/18.749020openalex-snapshot
Generalized Hamming weights of nonlinear codes and the relation to the Z/sub 4/-linear representation
inferred← citeshttps://doi.org/10.1109/18.749022openalex-snapshot
Constructions of generalized concatenated codes and their trellis-based decoding complexity
inferred← citeshttps://doi.org/10.1109/18.771239openalex-snapshot
The weighted coordinates bound and trellis complexity of block codes and periodic packings
inferred← citeshttps://doi.org/10.1109/18.771240openalex-snapshot
The Preparata and Goethals codes: trellis complexity and twisted squaring constructions
inferred← citeshttps://doi.org/10.1109/18.850685openalex-snapshot
Linear tail-biting trellises, the square-root bound, and applications for Reed-Muller codes
inferred← citeshttps://doi.org/10.1109/18.850686openalex-snapshot
Bounds on the state complexity of codes from the Hermitian function field and its subfields
inferred← citeshttps://doi.org/10.1109/18.904535openalex-snapshot
On a family of Abelian codes and their state complexities
inferred← citeshttps://doi.org/10.1109/18.945270openalex-snapshot
Reed-Muller codes: projections onto GF(4) and multilevel construction
inferred← citeshttps://doi.org/10.1109/26.536908openalex-snapshot
A* decoding of block codes
inferred← citeshttps://doi.org/10.1109/26.554286openalex-snapshot
Good trellises for IC implementation of Viterbi decoders for linear block codes
inferred← citeshttps://doi.org/10.1109/26.592553openalex-snapshot
On bit-error probability of a concatenated coding scheme
inferred← citeshttps://doi.org/10.1109/26.752809openalex-snapshot
Extended Hamming and BCH soft decision decoders for mobile data applications
inferred← citeshttps://doi.org/10.1109/26.752810openalex-snapshot
Iterative maximum-likelihood trellis decoding for block codes
inferred← citeshttps://doi.org/10.1109/26.923803openalex-snapshot
Interleaver properties and their applications to the trellis complexity analysis of turbo codes
inferred← citeshttps://doi.org/10.1109/49.661116openalex-snapshot
On iterative soft-decision decoding of linear binary block codes and product codes
inferred← citeshttps://doi.org/10.1109/5.989869openalex-snapshot
Space-time codes and concatenated channel codes for wireless communications
inferred← citeshttps://doi.org/10.1109/access.2018.2880997openalex-snapshot
Generalized LDPC Codes for Ultra Reliable Low Latency Communication in 5G and Beyond
inferred← citeshttps://doi.org/10.1109/aero47225.2020.9172641openalex-snapshot
Early Terminating Viterbi Decoding of Reed-Muller Code
inferred← citeshttps://doi.org/10.1109/eeei.2002.1178368openalex-snapshot
Simple MAP decoding of first order Reed-Muller and Hamming codes
inferred← citeshttps://doi.org/10.1109/fitce.2011.6133448openalex-snapshot
Low complexity Soft-Input Soft-Output Hamming Decoder
inferred← citeshttps://doi.org/10.1109/icc.2001.936972openalex-snapshot
Generalized array codes for wireless image communication in presence of fading
inferred← citeshttps://doi.org/10.1109/iccc47050.2019.9064373openalex-snapshot
Optimal Code Pairs Satisfying Relative Chain Condition
inferred← citeshttps://doi.org/10.1109/icct.1996.545237openalex-snapshot
Trellis decoding of block codes: practical approach
inferred← citeshttps://doi.org/10.1109/icct.2011.6158023openalex-snapshot
Some new bounds on relative generalized Hamming weight
inferred← citeshttps://doi.org/10.1109/icenco48310.2019.9027370openalex-snapshot
Distance Threshold Viterbi Decoding of Reed-Muller codes
inferred← citeshttps://doi.org/10.1109/isit.1993.748462openalex-snapshot
Weight Hierarchies of Binary Linear Codes of Dimension 4
inferred← citeshttps://doi.org/10.1109/isit.1994.394678openalex-snapshot
Low-complexity trellis decoding of linear block codes
inferred← citeshttps://doi.org/10.1109/isit.1994.394679openalex-snapshot
Density/length profiles and trellis complexity of linear block codes and lattices
inferred← citeshttps://doi.org/10.1109/isit.1994.394680openalex-snapshot
On the trellis complexity of composite-length cyclic codes
inferred← citeshttps://doi.org/10.1109/isit.1994.394709openalex-snapshot
On generalized distances
inferred← citeshttps://doi.org/10.1109/isit.1994.395086openalex-snapshot
The state complexity of trellis diagrams for a class of generalized concatenated codes
inferred← citeshttps://doi.org/10.1109/isit.1995.531333openalex-snapshot
On the twisted squaring construction, symmetric-reversible designs and trellis diagrams of block codes
inferred← citeshttps://doi.org/10.1109/isit.1998.708858openalex-snapshot
Junction tree representations for linear block codes
inferred← citeshttps://doi.org/10.1109/isit.2002.1023505openalex-snapshot
Weight hierarchies of linear codes satisfying the almost chain condition
inferred← citeshttps://doi.org/10.1109/isit.2011.6033887openalex-snapshot
On the treewidth of MDS and Reed-Muller codes
inferred← citeshttps://doi.org/10.1109/isit.2017.8006482openalex-snapshot
Generalized column distances for convolutional codes
inferred← citeshttps://doi.org/10.1109/isit.2019.8849486openalex-snapshot
Unrestricted Generalized Column Distances: A Wider Definition
inferred← citeshttps://doi.org/10.1109/itnw.1999.814374openalex-snapshot
Algorithms for finding good column permutations of codes
inferred← citeshttps://doi.org/10.1109/itw.2003.1216684openalex-snapshot
Simple MAP decoding of first order Reed-Muller and Hamming codes
inferred← citeshttps://doi.org/10.1109/jproc.2002.989867openalex-snapshot
Space-time codes and concatenated channel codes for wireless communications
inferred← citeshttps://doi.org/10.1109/jsac.2015.2504269openalex-snapshot
Polar Subcodes
inferred← citeshttps://doi.org/10.1109/lcomm.2020.2984382openalex-snapshot
Design of BCH Polarization Kernels With Reduced Processing Complexity
inferred← citeshttps://doi.org/10.1109/milcom.2000.904985openalex-snapshot
Performance of trellis decoding of block codes and the practice in compressed image communication over Rayleigh fading channel
inferred← citeshttps://doi.org/10.1109/ncc.2018.8600134openalex-snapshot
Determining the Generalized Hamming Weight Hierarchy of the Binary Projective Reed-Muller Code
inferred← citeshttps://doi.org/10.1109/pimrc.2000.881680openalex-snapshot
Performance of soft-decision trellis decoding of block codes in Rayleigh fading channel and its application to compressed image transmission
inferred← citeshttps://doi.org/10.1109/pimrc.2003.1264369openalex-snapshot
Gac-decomposition based soft decoding of block codes for multimedia data
inferred← citeshttps://doi.org/10.1109/tit.2003.813558openalex-snapshot
Codes on graphs: constraint complexity of cycle-free realizations of linear codes
inferred← citeshttps://doi.org/10.1109/tit.2003.815801openalex-snapshot
On the state complexity of hyperelliptic codes
inferred← citeshttps://doi.org/10.1109/tit.2004.831835openalex-snapshot
Simple MAP Decoding of First-Order Reed–Muller and Hamming Codes
inferred← citeshttps://doi.org/10.1109/tit.2008.928271openalex-snapshot
The Extraction and Complexity Limits of Graphical Models for Linear Codes
inferred← citeshttps://doi.org/10.1109/tit.2012.2191935openalex-snapshot
The Treewidth of MDS and Reed–Muller Codes
inferred← citeshttps://doi.org/10.1109/tit.2016.2570236openalex-snapshot
The Weight Hierarchy of Some Reducible Cyclic Codes
inferred← citeshttps://doi.org/10.1109/tit.2020.2999987openalex-snapshot
Generalized Column Distances
inferred← citeshttps://doi.org/10.1109/tit.2022.3217078openalex-snapshot
On the Subcode-Support-Weight Distributions of Some Classes of Optimal Codes
inferred← citeshttps://doi.org/10.1109/tit.2023.3277454openalex-snapshot
Generalized Hamming Weights of Linear Codes From Quadratic Forms Over Finite Fields of Even Characteristic
inferred← citeshttps://doi.org/10.1109/tst.2014.6919820openalex-snapshot
A class of the hamming weight hierarchy of linear codes with dimension 5
inferred← citeshttps://doi.org/10.1109/twc.2004.837405openalex-snapshot
Extended Hamming Product Codes Analytical Performance Evaluation for Low Error Rate Applications
inferred← citeshttps://doi.org/10.1109/vetecf.2000.886264openalex-snapshot
Block codes with soft-decision trellis decoding in compressed image transmission over Rayleigh fading channel
inferred← citeshttps://doi.org/10.1109/wcnc.2000.904846openalex-snapshot
GAC-based trellis decoding of block codes in Rayleigh fading channel
inferred← citeshttps://doi.org/10.1137/s089548019631431xopenalex-snapshot
On Projective Codes Satisfying the Chain Condition
inferred← citeshttps://doi.org/10.11501/3110102openalex-snapshot
Evaluating the block error probability of trellis codes and designing a recursive maximum likelihood decoding algorithm of linear block codes using their trellis structure
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0611089openalex-snapshot
The Extraction and Complexity Limits of Graphical Models for Linear Codes
inferred← citeshttps://doi.org/10.82308/33474openalex-snapshot
SOVA based on a sectionalized trellis of linear block codes
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.