On the public citation graph

On bit-level trellis complexity of Reed-Muller codes

0 signed · 16 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.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.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.1137/0608063openalex-snapshot
A Recursive Hadamard Transform Optimal Soft Decision Decoding Algorithm

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-4615-5745-6openalex-snapshot
Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes
inferred← citeshttps://doi.org/10.1017/9781009067928.009openalex-snapshot
Reed–Muller Codes
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.681330openalex-snapshot
On the trellis representation of the Delsarte-Goethals codes
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/26.752809openalex-snapshot
Extended Hamming and BCH soft decision decoders for mobile data applications
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/isit.2007.4557495openalex-snapshot
Conditionally Cycle-Free Generalized Tanner Graphs: Theory and Application to High-Rate Serially Concatenated Codes
inferred← citeshttps://doi.org/10.1109/itwksps.2010.5503223openalex-snapshot
A survey of reed-muller codes from polar coding perspective
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.