English
Related papers

Related papers: Run-Length-Limited ISI-Mitigation (RLIM) Coding fo…

200 papers

Practical guidance on training Large Language Models (LLMs) to leverage Code Interpreter across diverse tasks remains lacking. We present R1-Code-Interpreter, an extension of a text-only LLM trained via multi-turn supervised fine-tuning…

Artificial Intelligence · Computer Science 2026-03-05 Yongchao Chen , Yueying Liu , Junwei Zhou , Yilun Hao , Jingquan Wang , Yang Zhang , Na Li , Chuchu Fan

We consider the problem of Linear Programming (LP) decoding of binary linear codes. The LP excess lemma was introduced by the first author, B. Ghazi, and R. Urbanke (IEEE Trans. Inf. Th., 2014) as a technique to trade crossover probability…

Information Theory · Computer Science 2015-07-14 Louay Bazzi , Ibrahim Abou-Faycal

We study an incremental redundancy (IR) cooperative coding scheme for wireless networks. To exploit the spatial diversity benefit we propose a cluster-based collaborating strategy for a quasi-static Rayleigh fading channel model and based…

Information Theory · Computer Science 2007-07-13 Ruoheng Liu , Predrag Spasojevic , Emina Soljanin

In this paper, we present the first structural binarization method for LLM compression to less than 1-bit precision. Although LLMs have achieved remarkable performance, their memory-bound nature during the inference stage hinders the…

Machine Learning · Computer Science 2024-10-10 Peijie Dong , Lujun Li , Yuedong Zhong , Dayou Du , Ruibo Fan , Yuhan Chen , Zhenheng Tang , Qiang Wang , Wei Xue , Yike Guo , Xiaowen Chu

The rapid scaling of Large Language Models (LLMs) elevates inference costs and compounds substantial deployment barriers. While quantization to 8 or 4 bits mitigates this, sub-3-bit methods face severe accuracy, scalability, and efficiency…

In this work, we prove new results concerning the combinatorial properties of random linear codes. Firstly, we prove a lower bound on the list-size required for random linear codes over $\mathbb F_q$ $\varepsilon$-close to capacity to…

Information Theory · Computer Science 2022-05-04 Nicolas Resch , Chen Yuan

In this work, we analyze the capabilities and practical limitations of neural networks (NNs) for sequence-based signal processing which can be seen as an omnipresent property in almost any modern communication systems. In particular, we…

Information Theory · Computer Science 2019-11-22 Daniel Tandler , Sebastian Dörner , Sebastian Cammerer , Stephan ten Brink

Inter symbol interference (ISI), which occurs in a wide variety of channels, is a result of time dispersion. It can be mitigated by equalization, which results in noise coloring. Inspired by the development of Approximate Independence in…

Signal Processing · Electrical Eng. & Systems 2026-05-08 Ken R. Duffy , Moritz Grundei , Jane A. Millward , Muralidhar Rangaswamy , Muriel Medard

In this letter, we analyze the achievable rate of ultra-reliable low-latency communications (URLLC) in a randomly modeled wireless network. We use two mathematical tools to properly characterize the considered system: i) stochastic geometry…

Information Theory · Computer Science 2019-10-31 Jeonghun Park

The multiple-input and multiple-output (MIMO) technique is regarded as a promising approach to boost the throughput and reliability of optical fiber communications. However, the fundamental limits of optical fiber MIMO systems with finite…

Information Theory · Computer Science 2024-04-09 Xin Zhang , Dongfang Xu , Shenghui Song , Mérouane Debbah

Several types of AL-FEC (Application-Level FEC) codes for the Packet Erasure Channel exist. Random Linear Codes (RLC), where redundancy packets consist of random linear combinations of source packets over a certain finite field, are a…

Information Theory · Computer Science 2014-08-26 Kazuhisa Matsuzono , Vincent Roca , Hitoshi Asaeda

Sparse intersymbol-interference (ISI) channels are encountered in a variety of high-data-rate communication systems. Such channels have a large channel memory length, but only a small number of significant channel coefficients. In this…

Information Theory · Computer Science 2016-11-17 Jan Mietzner , Sabah Badri-Hoeher , Ingmar Land , Peter A. Hoeher

In this paper, we design matched filters for diffusive molecular communication systems taking into account the following impairments: signal-dependent diffusion noise, inter-symbol interference (ISI), and external interfering molecules. The…

Information Theory · Computer Science 2017-05-05 Vahid Jamali , Arman Ahmadzadeh , Robert Schober

We are in the midst of the noisy intermediate-scale quantum (NISQ) era, where quantum computers are limited by noisy gates, some of which are more error-prone than others and can render the final computation incomprehensible. Quantum…

Emerging Technologies · Computer Science 2025-05-13 Pranav Sinha , Sumit Kumar Jha , Sunny Raj

Bit-interleaved coded modulation (BICM) and multilevel coded modulation (MLC) are commonly used to combine polar codes with high order modulation. While BICM benefits from simple design and the separation of coding and modulation, MLC shows…

Information Theory · Computer Science 2022-02-16 Hanwen Yao , Jinfeng Du , Alexander Vardy

We propose a new class of information-coupled (IC) Turbo codes to improve the transport block (TB) error rate performance for long-term evolution (LTE) systems, while keeping the hybrid automatic repeat request protocol and the Turbo…

Information Theory · Computer Science 2017-09-21 Lei Yang , Yixuan Xie , Xiaowei Wu , Jinhong Yuan , Xingqing Cheng , Lei Wan

We present a multi-level quantum-classical intermediate representation (IR) that enables an optimizing, retargetable, ahead-of-time compiler for available quantum programming languages. To demonstrate our architecture, we leverage our…

Quantum Physics · Physics 2021-09-02 Thien Nguyen , Alexander McCaskey

To facilitate applications in IoT, 5G, and beyond, there is an engineering need to enable high-rate, low-latency communications. Errors in physical channels typically arrive in clumps, but most decoders are designed assuming that channels…

Information Theory · Computer Science 2023-04-18 Wei An , Muriel Médard , Ken R. Duffy

Recently, the authors showed that Reed-Muller (RM) codes achieve capacity on binary memoryless symmetric (BMS) channels with respect to bit error rate. This paper extends that work by showing that RM codes defined on non-binary fields,…

Information Theory · Computer Science 2023-05-16 Galen Reeves , Henry D. Pfister

We consider communication over binary-input memoryless output-symmetric channels using low-density parity-check codes and message-passing decoding. The asymptotic (in the length) performance of such a combination for a fixed number of…

Information Theory · Computer Science 2008-02-12 Satish Babu Korada , Ruediger Urbanke