Add to ORKGWe introduce a new family of graph-based source codes that can be regarded as a nonlinear generalization of LDPC codes, and apply them to the compression of asymmetric binary memoryless sources. Simulation results and the application of density evolution show that the proposed family presents a performance very close to the theoretical limits, clearly outperforming schemes based on linear codes.Peer Reviewe
"December 2006."Thesis (M.S.)--Wichita State University, College of Engineering, Dept. of Electrical...
Error-correcting codes seek to address the problem of transmitting information efficiently and relia...
International audienceIn this paper, we consider the construction of a Slepian-Wolf source coding sc...
We introduce a new family of graph-based source codes that can be regarded as a nonlinear generaliza...
Abstract—We introduce a new family of graph-based source codes that can be regarded as a nonlinear g...
We study the behavior of a new family of nonlinear graph-based codes, previously introduced for com...
Abstract—We study the behavior of a new family of non-linear graph-based codes, previously introduce...
We propose a novel scheme for source coding of non-uniform memoryless binary sources based on progre...
Thesis (M.S.)--Wichita State University, College of Engineering, Dept. of Electrical and Computer En...
Abstract—We propose a scheme to implement lossy data compression for discrete equiprobable sources u...
We are undergoing a revolution in data. The ever-growing amount of information in our world has crea...
Sparse graph codes were first introduced by Gallager over 40 years ago. Over the last two decades, s...
In order to perform source coding (data compression), we treat messages emitted by independent and i...
Low-Density Parity-Check (LDPC) codes are among the most effective modern error-correcting codes due...
In this paper, we explore the use of LDPC codes for nonuniform sources under distributed source codi...
"December 2006."Thesis (M.S.)--Wichita State University, College of Engineering, Dept. of Electrical...
Error-correcting codes seek to address the problem of transmitting information efficiently and relia...
International audienceIn this paper, we consider the construction of a Slepian-Wolf source coding sc...
We introduce a new family of graph-based source codes that can be regarded as a nonlinear generaliza...
Abstract—We introduce a new family of graph-based source codes that can be regarded as a nonlinear g...
We study the behavior of a new family of nonlinear graph-based codes, previously introduced for com...
Abstract—We study the behavior of a new family of non-linear graph-based codes, previously introduce...
We propose a novel scheme for source coding of non-uniform memoryless binary sources based on progre...
Thesis (M.S.)--Wichita State University, College of Engineering, Dept. of Electrical and Computer En...
Abstract—We propose a scheme to implement lossy data compression for discrete equiprobable sources u...
We are undergoing a revolution in data. The ever-growing amount of information in our world has crea...
Sparse graph codes were first introduced by Gallager over 40 years ago. Over the last two decades, s...
In order to perform source coding (data compression), we treat messages emitted by independent and i...
Low-Density Parity-Check (LDPC) codes are among the most effective modern error-correcting codes due...
In this paper, we explore the use of LDPC codes for nonuniform sources under distributed source codi...
"December 2006."Thesis (M.S.)--Wichita State University, College of Engineering, Dept. of Electrical...
Error-correcting codes seek to address the problem of transmitting information efficiently and relia...
International audienceIn this paper, we consider the construction of a Slepian-Wolf source coding sc...