English
Related papers

Related papers: Code Design Principles for Ultra-Reliable Random A…

200 papers

Parameter selection is one of the most important parts for nearly all the control strategies. Traditionally, controller parameters are chosen by utilizing trial and error, which is always tedious and time consuming. Moreover, such method is…

Systems and Control · Electrical Eng. & Systems 2022-04-13 Yujia Wang , Tong Wang , Jiae Yang , Xuebo Yang

Environmental noise (e.g.heat, ionized particles, etc.) causes transient faults in hardware, which lead to corruption of stored values. Mission-critical devices require such faults to be mitigated by fault-tolerance --- a combination of…

Cryptography and Security · Computer Science 2014-10-28 Filippo Del Tedesco , David Sands , Alejandro Russo

We introduce the concept of an \ff-maximal error-detecting block code, for some parameter \ff{} between 0 and 1, in order to formalize the situation where a block code is close to maximal with respect to being error-detecting. Our…

Information Theory · Computer Science 2016-08-01 Stavros Konstantinidis , Nelma Moreira , Rogerio Reis

Random linear codes are a workhorse in coding theory, and are used to show the existence of codes with the best known or even near-optimal trade-offs in many noise models. However, they have little structure besides linearity, and are not…

Computational Complexity · Computer Science 2024-07-11 Venkatesan Guruswami , Jonathan Mosheiff

A dealer aims to share a secret with participants so that only predefined subsets can reconstruct it, while others learn nothing. The dealer and participants access correlated randomness and communicate over a one-way, public, rate-limited…

Information Theory · Computer Science 2026-01-27 Rumia Sultana , Remi A. Chou

Fault-tolerant distributed algorithms are central for building reliable spatially distributed systems. Unfortunately, the lack of a canonical precise framework for fault-tolerant algorithms is an obstacle for both verification and…

Formal Languages and Automata Theory · Computer Science 2012-10-16 Annu John , Igor Konnov , Ulrich Schmid , Helmut Veith , Josef Widder

We present finite-blocklength achievability bounds for the unsourced A-channel. In this multiple-access channel, users noiselessly transmit codewords picked from a common codebook with entries generated from a $q$-ary alphabet. At each…

Information Theory · Computer Science 2022-10-06 Alejandro Lancho , Alexander Fengler , Yury Polyanskiy

Wireless receiver design is critical to the overall system performance. In this work, we apply the techniques of mixed-integer programming to formulate a unified receiver in relay networks with only partial channel information. We also…

Information Theory · Computer Science 2018-08-30 Kun Wang

Fundamental rate-distortion-perception (RDP) trade-offs arise in applications requiring maintained perceptual quality of reconstructed data, such as neural image compression. When compressed data is transmitted over public communication…

Information Theory · Computer Science 2026-04-23 Gustaf Åhlgren , Onur Günlü

Error control is significant to network coding, since when unchecked, errors greatly deteriorate the throughput gains of network coding and seriously undermine both reliability and security of data. Two families of codes, subspace and rank…

Information Theory · Computer Science 2012-05-04 Zhiyuan Yan , Hongmei Xie

This paper applies error-exponent and dispersion-style analyses to derive finite-blocklength achievability bounds for low-density parity-check (LDPC) codes over the point-to-point channel (PPC) and multiple access channel (MAC). The…

Information Theory · Computer Science 2020-05-14 Yuxin Liu , Michelle Effros

We study the problem of scheduling jobs on fault-prone machines communicating via a shared channel, also known as multiple-access channel. We have $n$ arbitrary length jobs to be scheduled on $m$ identical machines, $f$ of which are prone…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-07-26 Marek Klonowski , Dariusz R. Kowalski , Jarosław Mirek , Prudence W. H. Wong

The construction of preamble sequences for channel estimation by superposition of orthogonal pilots can improve performance of massive grant-free uplink from machine-type devices. In this letter, a technique is proposed to obtain full…

Information Theory · Computer Science 2023-12-25 Lorenzo Valentini , Elena Bernardi , Enrico Paolini

HyperSurfaces are a merge of structurally reconfigurable metasurfaces whose electromagnetic properties can be changed via a software interface, using an embedded miniaturized network of controllers, thus enabling novel capabilities in…

Surface codes are quantum error correcting codes normally defined on 2D arrays of qubits. In this paper, we introduce a surface code design based on the fact that the severity of bit flip and phase flip errors in the physical quantum…

Making a reversible circuit fault-tolerant is much more difficult than classical circuit and there have been only a few works in the area of parity-preserving reversible logic design. Moreover, all of these designs are ad hoc, based on some…

Hardware Architecture · Computer Science 2013-08-06 Goutam Paul , Anupam Chattopadhyay , Chander Chandak

Consider a source and multiple users who observe the independent and identically distributed (i.i.d.) copies of correlated Gaussian random variables. The source wishes to compress its observations and store the result in a public database…

Information Theory · Computer Science 2024-07-31 Hassan ZivariFard , Remi A. Chou

The outage probability limit is a fundamental and achievable lower bound on the word error rate of coded communication systems affected by fading. This limit is mainly determined by two parameters: the diversity order and the coding gain.…

Information Theory · Computer Science 2012-10-05 Dieter Duyck , Joseph Jean Boutros , Marc Moeneclaey

Interactive coding allows two parties to conduct a distributed computation despite noise corrupting a certain fraction of their communication. Dani et al.\@ (Inf.\@ and Comp., 2018) suggested a novel setting in which the amount of noise is…

Data Structures and Algorithms · Computer Science 2024-07-15 Eden Fargion , Ran Gelles , Meghal Gupta

Multi-party random number generation is a key building-block in many practical protocols. While straightforward to solve when all parties are trusted to behave correctly, the problem becomes much more difficult in the presence of faults. In…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-12-15 Luciano Freitas de Souza , Andrei Tonkikh , Sara Tucci-Piergiovanni , Renaud Sirdey , Oana Stan , Nicolas Quero , Petr Kuznetsov