English
Related papers

Related papers: Weight vs Magnetization Enumerator for Gallager Co…

200 papers

In this paper, we devote to devise a non-binary low-density parity-check (LDPC) decoder in Galois fields of characteristic two ($\mathbb{F}_{2^q}$) via the alternating direction method of multipliers (ADMM) technique. Through the proposed…

Information Theory · Computer Science 2022-02-08 Xiaomeng Guo , Yongchao Wang

Calorimeters operating in high-radiation environments are susceptible to damage, leading to increased noise that can significantly degrade energy resolution. A common way to mitigate noise is to apply a higher energy threshold on the cells,…

Instrumentation and Detectors · Physics 2025-09-16 Suman Das Gupta , Shamik Ghosh , Laltu Gazi , Shubham Dutta , Alexander Ledovskoy , Satyaki Bhattacharya , Shilpi Jain

A new algorithm for efficient exact maximum likelihood decoding of polar codes (which may be CRC augmented), transmitted over the binary erasure channel, is presented. The algorithm applies a matrix triangulation process on a sparse polar…

Information Theory · Computer Science 2021-06-29 Yonatan Urman , David Burshtein

We consider an approach to fault tolerant quantum computing based on a simple error detecting code operating as the substrate for a conventional surface code. We develop a customised decoder to process the information about the likely…

Quantum Physics · Physics 2019-12-11 Xiaosi Xu , Qi Zhao , Xiao Yuan , Simon C. Benjamin

Sphere decoding (SD) of polar codes is an efficient method to achieve the error performance of maximum likelihood (ML) decoding. But the complexity of the conventional sphere decoder is still high, where the candidates in a target sphere…

Information Theory · Computer Science 2013-08-14 Kai Niu , Kai Chen , Jiaru Lin

Consider data transmission over a binary-input additive white Gaussian noise channel using a binary low-density parity-check code. We ask the following question: Given a decoder that takes log-likelihood ratios as input, does it help to…

Information Theory · Computer Science 2016-11-17 Jon Feldman , Ralf Koetter , Pascal O. Vontobel

Topological quantum error-correcting codes are a promising candidate for building fault-tolerant quantum computers. Decoding topological codes optimally, however, is known to be a computationally hard problem. Various decoders have been…

Quantum Physics · Physics 2020-04-01 Milap Sheth , Sara Zafar Jafarzadeh , Vlad Gheorghiu

The performance of short polar codes under successive cancellation (SC) and SC list (SCL) decoding is analyzed for the case where the decoder messages are coarsely quantized. This setting is of particular interest for applications requiring…

Information Theory · Computer Science 2020-09-14 Joachim Neu , Mustafa Cemil Coşkun , Gianluigi Liva

Stabilizer codes are the most widely studied class of quantum error-correcting codes and form the basis of most proposals for a fault-tolerant quantum computer. A stabilizer code is defined by a set of parity-check operators, which are…

Quantum Physics · Physics 2025-04-15 Eric Sabo , Lane G. Gunderman , Benjamin Ide , Michael Vasmer , Guillaume Dauphinais

This paper presents new structure and adaptation criterion for equalization of two-dimensional magnetic recording channels, as opposed to typical linear equalizer with minimum mean square error (MMSE) as adaptation criterion. To compensate…

Signal Processing · Electrical Eng. & Systems 2019-12-18 Jinlu Shen , Nitin Nangare

We propose a novel construction of product codes for high-density magnetic recording based on binary low-density parity check (LDPC) codes and binary image of Reed Solomon (RS) codes. Moreover, two novel algorithms are proposed to decode…

Information Theory · Computer Science 2012-01-06 Vo Tam Van , Seiichi Mita

This paper presents a refined analysis of the block error rate (BLER) of polar codes over symmetric binary-input discrete memoryless channels under successive cancellation (SC) and successive cancellation list (SCL) decoding. A novel…

Information Theory · Computer Science 2026-03-23 Hassan Noghrei , Murad Abdullah

In this paper, a novel decoding algorithm for low-density parity-check (LDPC) codes based on convex optimization is presented. The decoding algorithm, called interior point decoding, is designed for linear vector channels. The linear vector…

Information Theory · Computer Science 2009-11-13 Tadashi Wadayama

Entanglement is one of the fundamental properties of a quantum state and is a crucial differentiator between classical and quantum computation. There are many ways to define entanglement and its measure, depending on the problem or…

Quantum Physics · Physics 2025-01-07 Andrii Semenov , Niall Murphy , Simone Patscheider , Alessandra Bernardi , Elena Blokhina

We develop several analytical lower bounds on the capacity of binary insertion and deletion channels by considering independent uniformly distributed (i.u.d.) inputs and computing lower bounds on the mutual information between the input and…

Information Theory · Computer Science 2015-03-17 Mojtaba Rahmati , Tolga M. Duman

In this paper we consider a Metzner-Kapturowski-like decoding algorithm for high-order interleaved sum-rank-metric codes, offering a novel perspective on the decoding process through the concept of an error code. The error code, defined as…

Information Theory · Computer Science 2024-09-30 Thomas Jerkovits , Felicitas Hörmann , Hannes Bartz

In this paper we present a new method for finding the weight enumerator of binary linear block codes by using genetic algorithms. This method consists in finding the binary weight enumerator of the code and its dual and to create from the…

Information Theory · Computer Science 2013-03-19 Said Nouh , Mostafa Belkasmi

Nuclear Magnetic Resonance (NMR) spectroscopy, which is modeled as the sum of damped exponential signals, has become an indispensable tool in various scenarios, such as the structure and function determination, chemical analysis, and…

Medical Physics · Physics 2020-11-17 Tianyu Qiu , Wenjing Liao , Di Guo , Dongbao Liu , Xin Wang , Jian-Feng Cai , Xiaobo Qu

The $p_3$-PPT criterion is an experimentally viable relaxation of the well-known positive partial transposition (PPT) criterion for the certification of quantum entanglement. Recently, it has been generalized to various families of…

Quantum Physics · Physics 2026-04-15 Daniel Miller , Jens Eisert

A recent line of work has focused on the use of low-density generator matrix (LDGM) codes for lossy source coding. In this paper, wedevelop a generic technique for deriving lower bounds on the rate-distortion functions of binary linear…

Information Theory · Computer Science 2008-08-18 A. G. Dimakis , M. J. Wainwright , K. Ramchandran