Related papers: A New Class of TAST Codes With A Simplified Tree S…
Subspace codes were introduced by K\"otter and Kschischang for error control in random linear network coding. In this paper, a layered type of subspace codes is considered, which can be viewed as a superposition of multiple component…
The rapidly improving performance of modern hardware renders convolutional codes obsolete, and allows for the practical implementation of more sophisticated correction codes such as low density parity check (LDPC) and turbo codes (TC). Both…
Priority encoders are typically considered expensive hardware components in terms of complexity, especially at high bit precisions or input lengths (e.g., above 512 bits). However, if the complexity can be reduced, priority encoders can…
We propose an iterative decoding method, which we call turbo-CS, for the reception of concatenated source-channel encoded sparse signals transmitted over an AWGN channel. The turbo-CS encoder applies 1-bit compressed sensing as a source…
Sorting networks are oblivious sorting algorithms with many practical applications and rich theoretical properties. Propositional encodings of sorting networks are a key tool for proving concrete bounds on the minimum number of comparators…
Constellation Constrained (CC) capacity regions of a two-user SISO Gaussian Multiple Access Channel (GMAC) with finite complex input alphabets and continuous output are computed in this paper. When both the users employ the same code…
A new coding scheme for image transmission over noisy channel is proposed. Similar to standard image compression, the scheme includes a linear transform followed by successive refinement scalar quantization. Unlike conventional schemes, in…
Streaming erasure codes guarantee that each source packet is recovered within a fixed delay at the receiver over a burst-erasure channel. This paper introduces a new class of streaming codes: Diversity Embedded Streaming Erasure Codes…
The problem of stabilizing an unstable plant over a noisy communication link is an increasingly important one that arises in applications of networked control systems. Although the work of Schulman and Sahai over the past two decades, and…
We put forth new models for universal channel coding. Unlike standard codes which are designed for a specific type of channel, our most general universal code makes communication resilient on every channel, provided the noise level is below…
In this paper, we introduce a new way of constructing and decoding multipermutation codes. Multipermutations are permutations of a multiset that generally consist of duplicate entries. We first introduce a class of binary matrices called…
In this article, the first general constructions of fast-decodable, more specifically (conditionally) $g$-group decodable, space-time block codes for the Nonorthogonal Amplify and Forward (NAF) Multiple-Input Multiple-Output (MIMO) relay…
Tree codes, introduced by Schulman, are combinatorial structures essential to coding for interactive communication. An infinite family of tree codes with both rate and distance bounded by positive constants is called asymptotically good.…
A rateless code-i.e., a rate-compatible family of codes-has the property that codewords of the higher rate codes are prefixes of those of the lower rate ones. A perfect family of such codes is one in which each of the codes in the family is…
Single Input-Multiple Output (SIMO) systems are key enablers of high data rates in the next generation wireless communications. However in SIMO systems, channel estimation and equalization are challenging particularly in the presence of…
We consider the problem of coding for the substring channel, in which information strings are observed only through their (multisets of) substrings. Due to existing DNA sequencing techniques and applications in DNA-based storage systems,…
In this paper we propose, implement, and test the first practical decomposition algorithms for the width parameters treecut width and treedepth. These two parameters have recently gained a lot of attention in the theoretical research…
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…
A general multi-terminal source code and a general multi-terminal channel code are presented. Constrained-random-number generators with sparse matrices, which are building blocks for the code construction, are used in the construction of…
Natural language text corpora are often available as sets of syntactically parsed trees. A wide range of expressive tree queries are possible over such parsed trees that open a new avenue in searching over natural language text. They not…