English
Related papers

Related papers: Frame Codes for the Block-Erasure Channel -- Exten…

200 papers

The stochastic blockmodel (SBM) models the connectivity within and between disjoint subsets of nodes in networks. Prior work demonstrated that the rows of an SBM's adjacency spectral embedding (ASE) and Laplacian spectral embedding (LSE)…

Methodology · Statistics 2022-05-04 Zachary M. Pisano , Joshua S. Agterberg , Carey E. Priebe , Daniel Q. Naiman

By using joint modulation and customized constellation set, we show that Quasi-Orthogonal Space-Time Block Code (QO-STBC) can be used to form a new differential space-time modulation (DSTM) scheme to provide full transmit diversity with…

Information Theory · Computer Science 2008-06-23 Chau Yuen , Yong Liang Guan , Tjeng Thiang Tjhung

Non-orthogonal multiple access (NOMA) has attracted great recent attention due to its high spectral efficiency. Besides, NOMA can be easily implemented in physical layer, thus its interplays with other psychical layer techniques have been…

Information Theory · Computer Science 2020-04-28 Ferdi Kara , Hakan Kaya

This paper addresses the performance of space-time coding over fading channels with impulsive noise which is known to accurately capture network interference. We use the symmetric alpha stable noise distribution and adopt two models which…

Information Theory · Computer Science 2011-02-17 Junghoon Lee , Cihan Tepedelenlioglu

The distance profiles of linear block codes can be employed to design variational coding scheme for encoding message with variational length and getting lower decoding error probability by large minimum Hamming distance. %, e.g. the design…

Information Theory · Computer Science 2013-06-05 Xiaogang Liu , Yuan Luo , Kenneth W. Shum

Code Division Multiple Access (CDMA) in which the signature code assignment to users contains a random element has recently become a cornerstone of CDMA research. The random element in the construction is particularly attractive in that it…

Information Theory · Computer Science 2008-06-23 Jack Raymond , David Saad

The paper introduces ensembles of accumulate-repeat-accumulate (ARA) codes which asymptotically achieve capacity on the binary erasure channel (BEC) with {\em bounded complexity}, per information bit, of encoding and decoding. It also…

Information Theory · Computer Science 2009-09-29 Henry D. Pfister , Igal Sason

Low-depth random circuit codes possess many desirable properties for quantum error correction but have so far only been analyzed in the code capacity setting where it is assumed that encoding gates and syndrome measurements are noiseless.…

Quantum Physics · Physics 2023-12-01 Jon Nelson , Gregory Bentsen , Steven T. Flammia , Michael J. Gullans

Fair threshold estimation for bivariate bicycle (BB) codes on the quantum erasure channel runs into two recurring problems: decoder-baseline unfairness and the conflation of finite-size pseudo-thresholds with true asymptotic thresholds. We…

Quantum Physics · Physics 2026-04-28 Tushar Pandey

Spread-spectrum signals are increasingly adopted in fields including communications, testing of electronic systems, Electro-Magnetic Compatibility (EMC) enhancement, ultrasonic non-destructive testing. This paper considers the synthesis of…

Data Analysis, Statistics and Probability · Physics 2014-12-22 Sergio Callegari

There is growing interest in the use of coded aperture imaging systems for a variety of applications. Using an analysis framework based on mutual information, we examine the fundamental limits of such systems---and the associated optimum…

Image and Video Processing · Electrical Eng. & Systems 2017-12-14 Adam Yedidia , Christos Thrampoulidis , Gregory Wornell

We derive the optimum second-order coding rates, known as second-order capacities, for erasure and list decoding. For erasure decoding for discrete memoryless channels, we show that second-order capacity is $\sqrt{V}\Phi^{-1}(\epsilon_t)$…

Information Theory · Computer Science 2014-04-22 Vincent Y. F. Tan , Pierre Moulin

Various communication technologies are expected to utilize mobile ad hoc networks (MANETs). By combining MANETs with non-orthogonal multiple access (NOMA) communications, one can support scalable, spectrally efficient, and flexible network…

Information Theory · Computer Science 2024-06-11 Tomer Alter , Nir Shlezinger

Algebraic decoding algorithms are commonly applied for the decoding of Reed-Solomon codes. Their main advantages are low computational complexity and predictable decoding capabilities. Many algorithms can be extended for correction of both…

Information Theory · Computer Science 2015-03-19 Christian Senger , Vladimir R. Sidorenko , Steffen Schober , Martin Bossert , Victor V. Zyablov

In communication through asymmetric channels the capacity-achieving input distribution is not uniform in general. Homophonic coding is a framework to invertibly convert a (usually uniform) message into a sequence with some target…

Information Theory · Computer Science 2017-06-30 Junya Honda , Hirosuke Yamamoto

A finite-field multiple-access (FFMA) system separates users within a finite field by utilizing different element-pairs (EPs) as virtual resources. The Cartesian product of distinct EPs forms an EP code, which serves as the input to a…

Information Theory · Computer Science 2025-06-18 Qi-yue Yu , Shi-wen Lin , Ting-wei Yang

Erasure coding techniques are used to increase the reliability of distributed storage systems while minimizing storage overhead. Also of interest is minimization of the bandwidth required to repair the system following a node failure. In a…

Information Theory · Computer Science 2009-10-06 K. V. Rashmi , Nihar B. Shah , P. Vijay Kumar , Kannan Ramchandran

An error-erasure channel is a simple noise model that introduces both errors and erasures. While the two types of errors can be corrected simultaneously with error-correcting codes, it is also known that any linear code allows for first…

Information Theory · Computer Science 2019-03-19 Yu Tsunoda , Yuichiro Fujiwara , Hana Ando , Peter Vandendriessche

Scientific computing workflows generate enormous distributed data that is short-lived, yet critical for job completion time. This class of data is called intermediate data. A common way to achieve high data availability is to replicate…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-04-14 Zhe Zhang , Brian Bockelman , Derek Weitzel , David Swanson

Sparse Code Division Multiple Access (CDMA), a variation on the standard CDMA method in which the spreading (signature) matrix contains only a relatively small number of non-zero elements, is presented and analysed using methods of…

Information Theory · Computer Science 2009-11-13 Jack Raymond , David Saad
‹ Prev 1 8 9 10 Next ›