On the public citation graph
Good trellises for IC implementation of Viterbi decoders for linear block codes
0 signed · 55 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1109/18.179359openalex-snapshot
Bounds on the trellis size of linear block codes
inferredcites →https://doi.org/10.1109/18.179366openalex-snapshot
On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear 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.1109/18.259635openalex-snapshot
The dynamics of group codes: state spaces, trellis diagrams, and canonical encoders
inferredcites →https://doi.org/10.1109/18.312184openalex-snapshot
Maximum-likelihood soft decision decoding of BCH codes
inferredcites →https://doi.org/10.1109/18.340452openalex-snapshot
Dimension/length profiles and trellis complexity of linear block codes
inferredcites →https://doi.org/10.1109/18.370171openalex-snapshot
Asymptotically good codes have infinite trellis complexity
inferredcites →https://doi.org/10.1109/18.370172openalex-snapshot
On the trellis complexity of certain binary linear block codes
inferredcites →https://doi.org/10.1109/18.391268openalex-snapshot
Trellis-oriented decomposition and trellis complexity of composite-length cyclic codes
inferredcites →https://doi.org/10.1109/18.476317openalex-snapshot
On the trellis structure of block codes
inferredcites →https://doi.org/10.1109/18.476318openalex-snapshot
Lower bounds on trellis complexity of block codes
inferredcites →https://doi.org/10.1109/18.490504openalex-snapshot
Optimal sectionalization of a trellis
inferredcites →https://doi.org/10.1109/18.508834openalex-snapshot
On the BCJR trellis for linear block codes
inferredcites →https://doi.org/10.1109/26.192404openalex-snapshot
The subtleties and intricacies of building a constraint length 15 convolutional decoder
inferredcites →https://doi.org/10.1109/26.31176openalex-snapshot
Parallel Viterbi algorithm implementation: breaking the ACS-bottleneck
inferredcites →https://doi.org/10.1109/26.536916openalex-snapshot
Coset codes viewed as terminated convolutional codes
inferredcites →https://doi.org/10.1109/26.554286openalex-snapshot
Good trellises for IC implementation of Viterbi decoders for linear block codes
inferredcites →https://doi.org/10.1109/4.173118openalex-snapshot
A 140-Mb/s, 32-state, radix-4 Viterbi decoder
inferredcites →https://doi.org/10.1109/49.1921openalex-snapshot
Locally connected VLSI architectures for the Viterbi algorithm
inferredcites →https://doi.org/10.1109/icc.1989.49853openalex-snapshot
A block processing method for designing high-speed Viterbi detectors
inferredcites →https://doi.org/10.1109/isit.1994.395086openalex-snapshot
The state complexity of trellis diagrams for a class of generalized concatenated codes
inferredcites →https://doi.org/10.1109/isscc.1995.535288openalex-snapshot
A 210 Mb/s radix-4 bit-level pipelined Viterbi decoder
inferredcites →https://doi.org/10.1109/tit.1974.1055186openalex-snapshot
Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1978.1055821openalex-snapshot
Efficient maximum likelihood decoding of linear block codes using a trellis
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/ffta.1999.0265openalex-snapshot
On Trellis Structures for Reed–Muller Codes
inferred← citeshttps://doi.org/10.1007/978-1-4757-3585-7_18openalex-snapshot
Adaptive Soft-Decision Decoding In Two Dimensions
inferred← citeshttps://doi.org/10.1007/bfb0025140openalex-snapshot
Non-minimal trellises for linear block codes
inferred← citeshttps://doi.org/10.1049/el:19970864openalex-snapshot
Efficient trellis decoding for both maximum andnear-maximumlikelihood performances
inferred← citeshttps://doi.org/10.1049/el:20040461openalex-snapshot
Optimal augmentation of product codes
inferred← citeshttps://doi.org/10.1049/ip-com:20010660openalex-snapshot
Efficient optimal soft-decision decoding for multilevel block modulation codes
inferred← citeshttps://doi.org/10.1049/ip-com:20050595openalex-snapshot
Geometric augmented product codes
inferred← citeshttps://doi.org/10.1109/18.508834openalex-snapshot
On the BCJR trellis for linear block codes
inferred← citeshttps://doi.org/10.1109/18.623171openalex-snapshot
Some decomposable codes: the |a+x|b+x|a+b+x| construction
inferred← citeshttps://doi.org/10.1109/26.843125openalex-snapshot
MAP algorithms for decoding linear block codes based on sectionalized trellis diagrams
inferred← citeshttps://doi.org/10.1109/aero47225.2020.9172641openalex-snapshot
Early Terminating Viterbi Decoding of Reed-Muller Code
inferred← citeshttps://doi.org/10.1109/ahs.2006.53openalex-snapshot
On the Trellis Structures of Geometric Augmented Product Codes
inferred← citeshttps://doi.org/10.1109/ccece.2001.933611openalex-snapshot
On high speed add-compare-select for Viterbi decoders
inferred← citeshttps://doi.org/10.1109/glocom.1998.775790openalex-snapshot
MAP algorithms for decoding linear block codes based on sectionalized trellis diagrams
inferred← citeshttps://doi.org/10.1109/glocom.2001.965548openalex-snapshot
On the binary images of (8, 5) shortened cyclic codes over GF(2/sup 8/)
inferred← citeshttps://doi.org/10.1109/ic3i.2014.7019617openalex-snapshot
Impact of interleaver and trace back length on performance of CODEC for burst errors
inferred← citeshttps://doi.org/10.1109/iccsn.2009.142openalex-snapshot
Error Control Mechanisms using CODEC
inferred← citeshttps://doi.org/10.1109/iscas.1999.780069openalex-snapshot
Recursive maximum likelihood decoder for high-speed satellite communication
inferred← citeshttps://doi.org/10.1109/isit.1998.708834openalex-snapshot
Fast soft-decision decoding for block codes using a trellis
inferred← citeshttps://doi.org/10.1109/isscc.1999.759284openalex-snapshot
A 755 Mb/s Viterbi decoder for the RM (64, 35, 8) subcode
inferred← citeshttps://doi.org/10.1109/istc.2010.5613809openalex-snapshot
Low complexity iterative decoding of product codes using a Generalized Array Code form of the Nordstrom-Robinson code
inferred← citeshttps://doi.org/10.1109/itw.1998.706444openalex-snapshot
Trellises and new trellis-based decoding algorithms for codes
inferred← citeshttps://doi.org/10.1109/lcomm.2004.823441openalex-snapshot
On Binary Images of Shortened Cyclic (8, 5) Codes Over $rm GF(2^8)$
inferred← citeshttps://doi.org/10.1109/tcomm.2010.07.090149openalex-snapshot
New Constructions of High-Performance Low-Complexity Convolutional Codes
inferred← citeshttps://doi.org/10.1109/tit.2006.876247openalex-snapshot
On Construction of the$(24, 12, 8)$Golay Codes
inferred← citeshttps://doi.org/10.31274/rtd-20201118-90openalex-snapshot
Implementation, verification and synthesis of the Gigabit Ethernet 1000BASE-T Physical Coding Sublayer
inferred← citeshttps://doi.org/10.4218/etrij.10.0109.0643openalex-snapshot
Nonlinear Product Codes and Their Low Complexity Iterative Decoding
showing the first 27 of 28 · page through all 28
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.