On the public citation graph

More efficient soft decoding of the Golay codes

0 signed · 71 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.1007/978-1-4757-2016-7openalex-snapshot
Sphere Packings, Lattices and Groups
inferredcites →https://doi.org/10.1016/s0021-9800(68)80067-5openalex-snapshot
On the uniqueness of the Golay codes
inferredcites →https://doi.org/10.1017/s0305004100052075openalex-snapshot
A new combinatorial approach to M24
inferredcites →https://doi.org/10.1109/18.21246openalex-snapshot
Coset codes. II. Binary lattices and related codes
inferredcites →https://doi.org/10.1109/18.32173openalex-snapshot
A bounded-distance decoding algorithm for the Leech lattice, with generalizations
inferredcites →https://doi.org/10.1109/18.42214openalex-snapshot
Maximum likelihood soft decoding of binary block codes and decoders for the Golay codes
inferredcites →https://doi.org/10.1109/49.1924openalex-snapshot
VLSI implementation of a maximum-likelihood decoder for the Golay (24, 12) code
inferredcites →https://doi.org/10.1109/49.29617openalex-snapshot
Fast decoding of the Leech lattice
inferredcites →https://doi.org/10.1109/tit.1954.1057466openalex-snapshot
Coding for constant-data-rate systems
inferredcites →https://doi.org/10.1109/tit.1986.1057135openalex-snapshot
Soft decoding techniques for codes and lattices, including the Golay code and the Leech lattice
inferredcites →https://doi.org/10.1109/tit.1986.1057189openalex-snapshot
Optimal soft decision block decoders based on fast Hadamard transform
inferredcites →https://doi.org/10.1109/tit.1986.1057197openalex-snapshot
Decoding the Golay codes
inferredcites →https://doi.org/10.1109/tit.1987.1057291openalex-snapshot
New trellis codes based on lattices and cosets
inferredcites →https://doi.org/10.13182/nse70-a19705openalex-snapshot
The Art of Computer Programming
inferredcites →https://doi.org/10.2307/2987917openalex-snapshot
Combinatorial Algorithms: Theory and Practice.

What points at this work

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

inferred← citeshttps://doi.org/10.1002/0471667846openalex-snapshot
Trellis and Turbo Coding
inferred← citeshttps://doi.org/10.1002/9781119106319.ch4openalex-snapshot
Trellis Representations
inferred← citeshttps://doi.org/10.1007/3-540-57843-9_24openalex-snapshot
Bounded-distance decoding of the Leech lattice and the Golay code
inferred← citeshttps://doi.org/10.1007/bfb0025140openalex-snapshot
Non-minimal trellises for linear block codes
inferred← citeshttps://doi.org/10.1007/s10623-007-9081-6openalex-snapshot
G-projectable and Λ-projectable binary linear block codes
inferred← citeshttps://doi.org/10.1007/s11767-000-0027-7openalex-snapshot
A new class of linear codes with two-level structure
inferred← citeshttps://doi.org/10.1049/el:19971350openalex-snapshot
Linear codes with Pless structures
inferred← citeshttps://doi.org/10.1049/ip-com:20000663openalex-snapshot
Acyclic Tanner graphs and maximum-likelihood decoding of linear block codes
inferred← citeshttps://doi.org/10.1109/18.243466openalex-snapshot
Maximum likelihood decoding of the Leech lattice
inferred← citeshttps://doi.org/10.1109/18.312184openalex-snapshot
Maximum-likelihood soft decision decoding of BCH codes
inferred← citeshttps://doi.org/10.1109/18.333895openalex-snapshot
The Nordstrom-Robinson code: representation over GF(4) and efficient decoding
inferred← citeshttps://doi.org/10.1109/18.335888openalex-snapshot
Soft trellis-based decoder for linear block codes
inferred← citeshttps://doi.org/10.1109/18.335970openalex-snapshot
The Leech lattice and the Golay code: bounded-distance decoding and multilevel constructions
inferred← citeshttps://doi.org/10.1109/18.391252openalex-snapshot
The Leech lattice, the octacode, and decoding algorithms
inferred← citeshttps://doi.org/10.1109/18.412683openalex-snapshot
Soft-decision decoding of linear block codes based on ordered statistics
inferred← citeshttps://doi.org/10.1109/18.490504openalex-snapshot
Optimal sectionalization of a trellis
inferred← citeshttps://doi.org/10.1109/18.556690openalex-snapshot
A bounded-distance decoding algorithm for binary linear block codes achieving the minimum effective error coefficient
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.651070openalex-snapshot
Reliability-based syndrome decoding of linear block codes
inferred← citeshttps://doi.org/10.1109/18.669296openalex-snapshot
Decoding linear block codes using a priority-first search: performance analysis and suboptimal version
inferred← citeshttps://doi.org/10.1109/18.720549openalex-snapshot
The art of signaling: fifty years of coding theory
inferred← citeshttps://doi.org/10.1109/18.737538openalex-snapshot
A new treatment of priority-first search maximum-likelihood soft-decision decoding of linear block codes
inferred← citeshttps://doi.org/10.1109/18.771145openalex-snapshot
Minimal tail-biting trellises: the Golay code and more
inferred← citeshttps://doi.org/10.1109/18.796407openalex-snapshot
Symbol-by-symbol APP decoding of the Golay code and iterative decoding of concatenated Golay codes
inferred← citeshttps://doi.org/10.1109/18.841183openalex-snapshot
Differential trellis decoding of convolutional codes
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.221070openalex-snapshot
On maximum likelihood soft decoding of some binary self-dual codes
inferred← citeshttps://doi.org/10.1109/26.380113openalex-snapshot
Constrained designs for maximum likelihood soft decoding of RM(2,m) and the extended Golay codes
inferred← citeshttps://doi.org/10.1109/26.494294openalex-snapshot
Efficient bounded-distance decoding of the hexacode and associated decoders for the Leech lattice and the Golay code
inferred← citeshttps://doi.org/10.1109/26.974248openalex-snapshot
Hexacode-based quantization of the Gaussian source at 1/2 bit per sample
inferred← citeshttps://doi.org/10.1109/ctrq.2010.41openalex-snapshot
Adaptive Decoding of Binary Linear Block Codes Using Information Sets and Erasures
inferred← citeshttps://doi.org/10.1109/dcc.2009.62openalex-snapshot
Low Bit Rate Vector Quantization of Outlier Contaminated Data Based on Shells of Golay Codes
inferred← citeshttps://doi.org/10.1109/eeei.2006.321093openalex-snapshot
Product Construction of Codes for Rayleigh Fading Channels
inferred← citeshttps://doi.org/10.1109/eeis.1991.217739openalex-snapshot
On maximum likelihood soft decoding of some binary self dual codes
inferred← citeshttps://doi.org/10.1109/ets.2001.979418openalex-snapshot
Leech lattice coding and modulation for IEEE 802.11a WLAN
inferred← citeshttps://doi.org/10.1109/icassp.1996.550581openalex-snapshot
High-speed parallel hard and soft-decision Golay decoder: algorithm and VLSI-architecture
inferred← citeshttps://doi.org/10.1109/icc.1997.595032openalex-snapshot
Max-Log-MAP filtering algorithm for decoding product F/sub 24/ code
inferred← citeshttps://doi.org/10.1109/isccsp.2010.5463322openalex-snapshot
Fast search on the shells of Golay codes
inferred← citeshttps://doi.org/10.1109/isit.1993.748376openalex-snapshot
Reduced Complexity Bounded-distance Decoding of the Leech Lattice
inferred← citeshttps://doi.org/10.1109/isit.1993.748589openalex-snapshot
Sequential Decoding of Linear Block Codes
inferred← citeshttps://doi.org/10.1109/isit.1994.394619openalex-snapshot
Efficient bounded-distance decoding of the hexacode and associated decoders for the Leech lattice and the Golay code
inferred← citeshttps://doi.org/10.1109/isit.1994.394624openalex-snapshot
Soft decision decoding of linear block codes based on ordered statistics
inferred← citeshttps://doi.org/10.1109/isit.1995.550461openalex-snapshot
Soft-decision decoding of binary linear block codes based on an iterative search algorithm
inferred← citeshttps://doi.org/10.1109/isit.1998.708675openalex-snapshot
An efficient symbol-by-symbol MAP decoding algorithm for the Golay code
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9517940openalex-snapshot
List Decoding of Polar Codes: How Large Should the List Be to Achieve ML Decoding?
inferred← citeshttps://doi.org/10.1109/itw.2003.1216695openalex-snapshot
On the structure of the binary (18,9,6) linear code
inferred← citeshttps://doi.org/10.1109/jphot.2024.3386818openalex-snapshot
Enhanced Performance of Intensity Modulation With Direct Detection Using Golay Encoded Nyquist Pulses and Electronic Dispersion Compensation
inferred← citeshttps://doi.org/10.1109/jsait.2023.3338326openalex-snapshot
Dimensions of Channel Coding: From Theory to Algorithms to Applications
inferred← citeshttps://doi.org/10.1109/pimrc.1996.567405openalex-snapshot
The effect of heuristic information on the soft-decision decoding for linear block codes
inferred← citeshttps://doi.org/10.1109/tcomm.2021.3111032openalex-snapshot
A Low-Complexity Probabilistic Amplitude Shaping With Short Linear Block Codes
inferred← citeshttps://doi.org/10.1109/tit.2003.811930openalex-snapshot
On the pless-construction and ML decoding of the (48, 24, 12) quadratic residue code
inferred← citeshttps://doi.org/10.1109/tit.2006.887465openalex-snapshot
Product Construction of Codes for Rayleigh-Fading Channels
inferred← citeshttps://doi.org/10.1109/tvlsi.2014.2346712openalex-snapshot
Efficient Hardware Implementation of Encoder and Decoder for Golay Code
inferred← citeshttps://doi.org/10.1109/vetecs.2003.1207158openalex-snapshot
Selection of channel coding for low-power wireless systems
inferred← citeshttps://doi.org/10.1137/s0895480102404367openalex-snapshot
Projections of Binary Linear Codes onto Larger Fields
inferred← citeshttps://doi.org/10.3390/electronics12122693openalex-snapshot
Soft Decision Decoding with Cyclic Information Set and the Decoder Architecture for Cyclic 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.