On the public citation graph

BEAST decoding for block codes

0 signed · 30 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.1109/18.340452openalex-snapshot
Dimension/length profiles and trellis complexity of linear block codes
inferredcites →https://doi.org/10.1109/18.476317openalex-snapshot
On the trellis structure of block codes
inferredcites →https://doi.org/10.1109/18.556677openalex-snapshot
The twisted squaring construction, trellis complexity, and generalized weights of BCH and QR codes
inferredcites →https://doi.org/10.1109/isit.2002.1023531openalex-snapshot
How to efficiently find the minimum distance of tailbiting codes
inferredcites →https://doi.org/10.1109/tcom.1986.1096498openalex-snapshot
On Tail Biting Convolutional Codes
inferredcites →https://doi.org/10.1109/tit.1967.1054010openalex-snapshot
Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
inferredcites →https://doi.org/10.1109/tit.1985.1057043openalex-snapshot
Covering radius---Survey and recent results
inferredcites →https://doi.org/10.1109/tit.2004.828093openalex-snapshot
A BEAST for Prowling in Trees
inferredcites →https://doi.org/10.1109/tit.2004.833342openalex-snapshot
Low State Complexity Block Codes Via Convolutional Codes
inferredcites →https://doi.org/10.1137/0137027openalex-snapshot
A Connection Between Block and Convolutional Codes

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781119098799.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/j.aeue.2004.11.028openalex-snapshot
The modulo-lattice channel: the key feature in precoding schemes
inferred← citeshttps://doi.org/10.1109/icc.2010.5501872openalex-snapshot
The BEAST for Maximum-Likelihood Detection in Non-Coherent MIMO Wireless Systems
inferred← citeshttps://doi.org/10.1109/isit.2004.1365382openalex-snapshot
On APP-decoding using BEAST
inferred← citeshttps://doi.org/10.1109/isit.2009.5205916openalex-snapshot
Searching for high-rate convolutional codes via binary syndrome trellises
inferred← citeshttps://doi.org/10.1109/isit.2014.6875086openalex-snapshot
Source-channel coding with multiple classes
inferred← citeshttps://doi.org/10.1109/isit.2018.8437559openalex-snapshot
A Score Function for Sequential Decoding of Polar Codes
inferred← citeshttps://doi.org/10.1109/itw.2005.1531846openalex-snapshot
BEAST decoding - asymptotic complexity
inferred← citeshttps://doi.org/10.1109/redundancy52534.2021.9606463openalex-snapshot
Bidirectional search application for polar codes with large kernels
inferred← citeshttps://doi.org/10.1109/tcomm.2013.020813.120275openalex-snapshot
An Efficient ML Decoder for Tail-Biting Codes Based on Circular Trap Detection
inferred← citeshttps://doi.org/10.1109/tit.2004.828093openalex-snapshot
A BEAST for Prowling in Trees
inferred← citeshttps://doi.org/10.1109/tit.2004.833342openalex-snapshot
Low State Complexity Block Codes Via Convolutional Codes
inferred← citeshttps://doi.org/10.1109/tit.2005.846448openalex-snapshot
BEAST Decoding of Block Codes Obtained Via Convolutional Codes
inferred← citeshttps://doi.org/10.1109/tit.2006.887522openalex-snapshot
Trellis Complexity of Short Linear Codes
inferred← citeshttps://doi.org/10.1109/tit.2007.915971openalex-snapshot
Soft-Output BEAST Decoding With Application to Product Codes
inferred← citeshttps://doi.org/10.1109/tit.2016.2588496openalex-snapshot
Multi-Class Source-Channel Coding
inferred← citeshttps://doi.org/10.1109/tit.2018.2866879openalex-snapshot
BP-LED Decoding Algorithm for LDPC Codes Over AWGN Channels
inferred← citeshttps://doi.org/10.1109/tvt.2014.2360528openalex-snapshot
A Depth-First ML Decoding Algorithm for Tail-Biting Trellises
inferred← citeshttps://doi.org/10.1186/1687-1499-2013-130openalex-snapshot
A low-complexity maximum likelihood decoder for tail-biting trellis
inferred← citeshttps://doi.org/10.17863/cam.45995openalex-snapshot
Multi-Class Source-Channel Coding
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.