Bounds on the decoding error probability of binary linear codes via their spectra

DOI10.1109/18.335935zbMath0821.94035OpenAlexW2098666392MaRDI QIDQ4324205

Gregory Poltyrev

Publication date: 1 March 1995

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.335935

zbMATH Keywords

boundsbinary linear codeadditive white Gaussian noiseunion boundweight spectrumrandom coding exponentBerlekamp's tangential bound

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Error probability in coding theory (94B70)

Related Items (9)

Error probabilities for bounded distance decoding ⋮ Performance bounds for QC-MDPC codes decoders ⋮ The parameterized Gallager's first bounds based on conditional triplet-wise error probability ⋮ New bounds on the distance distribution of extended Goppa codes ⋮ Variations on the Gallager bounds with some applications ⋮ Unnamed Item ⋮ Upper bound on the bit error probability of systematic binary linear codes via their weight spectra ⋮ Capacity and Error Exponents of Stationary Point Processes under Random Additive Displacements ⋮ Reed-Muller Codes

This page was built for publication: Bounds on the decoding error probability of binary linear codes via their spectra