Amanote Research

Amanote Research

    RegisterSign In

Bounds on Information Combining for Parity-Check Equations

doi 10.1109/izs.2004.1287390
Full Text
Open PDF
Abstract

Available in full text

Date

Unknown

Authors
I. LandP.A. HoeherJ. Huber
Publisher

IEEE


Related search

Bounds on the Maximum-Likelihood Decoding Error Probability of Low-Density Parity-Check Codes

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
2001English

Low Density Parity Check Lattices

English

Serial Genetic Algorithm Decoder for Low Density Parity Check Codes

International Journal of Communications, Network and System Sciences
2015English

Computational Bounds on Polynomial Differential Equations

Applied Mathematics and Computation
Computational MathematicsApplied Mathematics
2009English

Tree-Based Parity Check for an Optimal Data Hiding Scheme

IOSR Journal of Engineering
2012English

Low-Density Parity-Check Codes for Discretized Min-Sum Decoding

English

Multilevel Structured Low-Density Parity-Check Codes

2008English

Reliability-Based Coded Modulation for Low-Density Parity-Check Codes

English

Bounds for Solutions of Ordinary Differential Equations

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1963English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy