214 results
Search Results
2. Iterative Message Passing Algorithm for Vertex-Disjoint Shortest Paths.
- Author
-
Dai, Guowei, Guo, Longkun, Gutin, Gregory, Zhang, Xiaoyan, and Zhang, Zan-Bo
- Subjects
- *
TANNER graphs , *CODING theory , *ALGORITHMS , *DIRECTED graphs , *ARTIFICIAL intelligence , *GRAPH algorithms , *NP-hard problems , *WEIGHTED graphs - Abstract
As an algorithmic framework, message passing is extremely powerful and has wide applications in the context of different disciplines including communications, coding theory, statistics, signal processing, artificial intelligence and combinatorial optimization. In this paper, we investigate the performance of a message-passing algorithm called min-sum belief propagation (BP) for the vertex-disjoint shortest $k$ -path problem ($k$ -VDSP) on weighted directed graphs, and derive the iterative message-passing update rules. As the main result of this paper, we prove that for a weighted directed graph $G$ of order $n$ , BP algorithm converges to the unique optimal solution of $k$ -VDSP on $G$ within $O(n^{2}w_{max})$ iterations, provided that the weight $w_{e}$ is nonnegative integral for each arc $e\in E(G)$ , where $w_{max}=\max \{w_{e}: e\in E(G)\}$. To the best of our knowledge, this is the first instance where BP algorithm is proved correct for NP-hard problems. Additionally, we establish the extensions of $k$ -VDSP to the case of multiple sources or sinks. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
3. On the Rate of Convergence of a Classifier Based on a Transformer Encoder.
- Author
-
Gurevych, Iryna, Kohler, Michael, and Sahin, Gozde Gul
- Subjects
- *
NATURAL language processing , *PATTERN recognition systems - Abstract
Pattern recognition based on a high-dimensional predictor is considered. A classifier is defined which is based on a Transformer encoder. The rate of convergence of the misclassification probability of the classifier towards the optimal misclassification probability is analyzed. It is shown that this classifier is able to circumvent the curse of dimensionality provided the a posteriori probability satisfies a suitable hierarchical composition model. Furthermore, the difference between the Transformer classifiers theoretically analyzed in this paper and the ones used in practice today is illustrated by means of classification problems in natural language processing. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
4. Cooperative Multiple-Access Channels With Distributed State Information.
- Author
-
Miretti, Lorenzo, Kobayashi, Mari, Gesbert, David, and de Kerret, Paul
- Subjects
- *
TRANSMITTERS (Communication) , *GAUSSIAN channels , *TRANSMITTING antennas , *COOPERATIVE societies , *CHANNEL coding , *WIRELESS communications - Abstract
This paper studies a memoryless state-dependent multiple access channel (MAC) where two transmitters wish to convey a message to a receiver under the assumption of causal and imperfect channel state information at transmitters (CSIT) and imperfect channel state information at receiver (CSIR). In order to emphasize the limitation of transmitter cooperation between physically distributed nodes, we focus on the so-called distributed CSIT assumption, i.e., where each transmitter has its individual channel knowledge, while the message can be assumed to be partially or entirely shared a priori between transmitters by exploiting some on-board memory. Under this setup, the first part of the paper characterizes the common message capacity of the channel at hand for arbitrary CSIT and CSIR structure. The optimal scheme builds on Shannon strategies, i.e., optimal codes are constructed by letting the channel inputs be a function of current CSIT only. For a special case when CSIT is a deterministic function of CSIR, the considered scheme also achieves the capacity region of a common message and two private messages. The second part addresses an important instance of the previous general result in a context of a cooperative multi-antenna Gaussian channel under i.i.d. fading operating in frequency-division duplex mode, such that CSIT is acquired via an explicit feedback of perfect CSIR. The capacity of the channel at hand is achieved by distributed linear precoding applied to Gaussian codes. Surprisingly, we demonstrate that it is suboptimal to send a number of data streams bounded by the number of transmit antennas as typically considered in a centralized CSIT setup. Finally, numerical examples are provided to evaluate the sum capacity of the binary MAC with binary states as well as the Gaussian MAC with i.i.d. fading. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
5. On the Information-Theoretic Security of Combinatorial All-or-Nothing Transforms.
- Author
-
Gu, Yujie, Akao, Sonata, Esfahani, Navid Nasr, Miao, Ying, and Sakurai, Kouichi
- Subjects
- *
INFORMATION-theoretic security , *DISTRIBUTION (Probability theory) , *INFORMATION technology security , *RANDOM variables - Abstract
All-or-nothing transforms (AONTs) were proposed by Rivest as a message preprocessing technique for encrypting data to protect against brute-force attacks, and have numerous applications in cryptography and information security. Later the unconditionally secure AONTs and their combinatorial characterization were introduced by Stinson. Informally, a combinatorial AONT is an array with the unbiased requirements and its security properties in general depend on the prior probability distribution on the inputs $s$ -tuples. Recently, it was shown by Esfahani and Stinson that a combinatorial AONT has perfect security provided that all the inputs $s$ -tuples are equiprobable, and has weak security provided that all the inputs $s$ -tuples are with non-zero probability. This paper aims to explore on the gap between perfect security and weak security for combinatorial $(t,s,v)$ -AONTs. Concretely, we consider the typical scenario that all the $s$ inputs take values independently (but not necessarily identically) and quantify the amount of information $H(\mathcal {X}|\mathcal {Y})$ about any $t$ inputs $\mathcal {X}$ that is not revealed by any $s-t$ outputs $\mathcal {Y}$. In particular, we establish the general lower and upper bounds on $H(\mathcal {X}|\mathcal {Y})$ for combinatorial AONTs using information-theoretic techniques, and also show that the derived bounds can be attained in certain cases. Furthermore, the discussions are extended for the security properties of combinatorial asymmetric AONTs. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
6. A Class of Optimal Structures for Node Computations in Message Passing Algorithms.
- Author
-
He, Xuan, Cai, Kui, and Zhou, Liang
- Subjects
- *
GRAPH algorithms - Abstract
Consider the computations at a node in a message passing algorithm. Assume that the node has incoming and outgoing messages $\mathbf {x} = (x_{1}, x_{2}, \ldots, x_{n})$ and $\mathbf {y} = (y_{1}, y_{2}, \ldots, y_{n})$ , respectively. In this paper, we investigate a class of structures that can be adopted by the node for computing $\mathbf {y}$ from $\mathbf {x}$ , where each $y_{j}, j = 1, 2, \ldots, n$ is computed via a binary tree with leaves $\mathbf {x}$ excluding $x_{j}$. We make three main contributions regarding this class of structures. First, we prove that the minimum complexity of such a structure is $3n - 6$ , and if a structure has such complexity, its minimum latency is $\delta + \lceil \log (n-2^{\delta }) \rceil $ with $\delta = \lfloor \log (n/2) \rfloor $ , where the logarithm always takes base two. Second, we prove that the minimum latency of such a structure is $\lceil \log (n-1) \rceil $ , and if a structure has such latency, its minimum complexity is $n \log (n-1)$ when $n-1$ is a power of two. Third, given $(n, \tau)$ with $\tau \geq \lceil \log (n-1) \rceil $ , we propose a construction for a structure which we conjecture to have the minimum complexity among structures with latencies at most $\tau $. Our construction method runs in $O(n^{3} \log ^{2}(n))$ time, and the obtained structure has complexity at most (generally much smaller than) $n \lceil \log (n) \rceil - 2$. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
7. Spatially Coupled Generalized LDPC Codes: Asymptotic Analysis and Finite Length Scaling.
- Author
-
Mitchell, David G. M., Olmos, Pablo M., Lentmaier, Michael, and Costello, Daniel J.
- Subjects
- *
LOW density parity check codes , *BLOCK codes , *ITERATIVE decoding , *LINEAR codes , *TANNER graphs , *DRUM set - Abstract
Generalized low-density parity-check (GLDPC) codes are a class of LDPC codes in which the standard single parity check (SPC) constraints are replaced by constraints defined by a linear block code. These stronger constraints typically result in improved error floor performance, due to better minimum distance and trapping set properties, at a cost of some increased decoding complexity. In this paper, we study spatially coupled generalized low-density parity-check (SC-GLDPC) codes and present a comprehensive analysis of these codes, including: (1) an iterative decoding threshold analysis of SC-GLDPC code ensembles demonstrating capacity approaching thresholds via the threshold saturation effect; (2) an asymptotic analysis of the minimum distance and free distance properties of SC-GLDPC code ensembles, demonstrating that the ensembles are asymptotically good; and (3) an analysis of the finite-length scaling behavior of both GLDPC block codes and SC-GLDPC codes based on a peeling decoder (PD) operating on a binary erasure channel (BEC). Results are compared to GLDPC block codes, and the advantages and disadvantages of SC-GLDPC codes are discussed. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
8. Finite-Field Matrix Channels for Network Coding.
- Author
-
Blackburn, Simon R. and Claridge, Jessica
- Subjects
- *
MATRICES (Mathematics) , *LINEAR network coding , *FINITE element method , *NUMERICAL analysis , *SUBSPACES (Mathematics) - Abstract
In 2010, Silva et al. studied certain classes of finite-field matrix channels in order to model random linear network coding where exactly $t$ random errors are introduced. In this paper, we consider a generalization of these matrix channels where the number of errors is not required to be constant, indeed the number of errors may follow any distribution. We show that a capacity-achieving input distribution can always be taken to have a very restricted form (the distribution should be uniform given the rank of the input matrix). This result complements, and is inspired by a paper of Nobrega et al., which establishes a similar result for a class of matrix channels that model network coding with link erasures. Our result shows that the capacity of our channels can be expressed as maximization over probability distributions on the set of possible ranks of input matrices: a set of linear rather than exponential size. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
9. On $\sigma$ -LCD Codes.
- Author
-
Carlet, Claude, Mesnager, Sihem, Tang, Chunming, and Qi, Yanfeng
- Subjects
- *
EUCLIDEAN geometry , *LINEAR statistical models , *BINARY codes , *ERROR-correcting codes , *MATHEMATICAL analysis - Abstract
Linear complementary pairs (LCPs) of codes play an important role in armoring implementations against side-channel attacks and fault injection attacks. One of the most common ways to construct LCP of codes is to use Euclidean linear complementary dual (LCD) codes. In this paper, we first introduce the concept of linear codes with $\sigma $ complementary dual ($\sigma $ -LCD), which includes known Euclidean LCD codes, Hermitian LCD codes, and Galois LCD codes. Like Euclidean LCD codes, $\sigma $ -LCD codes can also be used to construct LCP of codes. We show that for $q > 2$ , all $q$ -ary linear codes are $\sigma $ -LCD, and for every binary linear code $\mathcal C$ , the code $\{0\}\times \mathcal C$ is $\sigma $ -LCD. Furthermore, we study deeply $\sigma $ -LCD generalized quasi-cyclic (GQC) codes. In particular, we provide the characterizations of $\sigma $ -LCD GQC codes, self-orthogonal GQC codes, and self-dual GQC codes, respectively. Moreover, we provide the constructions of asymptotically good $\sigma $ -LCD GQC codes. Finally, we focus on $\sigma $ -LCD abelian codes and prove that all abelian codes in a semi-simple group algebra are $\sigma $ -LCD. The results derived in this paper extend those on the classical LCD codes and show that $\sigma $ -LCD codes allow the construction of LCP of codes more easily and with more flexibility. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
10. Reconstruction of Sequences Over Non-Identical Channels.
- Author
-
Horovitz, Michal and Yaakobi, Eitan
- Subjects
- *
NUMERICAL analysis , *GEOMETRIC vertices , *FOUNDATIONS of arithmetic , *DECODING algorithms , *NANOPARTICLES - Abstract
Motivated by the error behavior in the DNA storage channel, in this paper, we extend the previously studied sequence reconstruction problem by Levenshtein. The reconstruction problem studies the model in which the information is read through multiple noisy channels, and the decoder, which receives all channel estimations, is required to decode the information. For the combinatorial setup, the assumption is that all the channels cause at most some t errors. Levenshtein considered the case in which all the channels have the same behavior, and we generalize this model and assume that the channels are not identical. Thus, different channels may cause different maximum numbers of errors. For example, we assume that there are N channels, which cause at most t1 or t2 errors, where t1 < t2, and the number of channels with at most t1 errors is at least [pN], for some fixed 0 < p < 1. If the information codeword belongs to a code with minimum distance d, the problem is then to find the minimum number of channels that guarantees successful decoding in the worst case. A different problem we study in this paper is where the number of channels is fixed, and the question is finding the minimum distance d that provides exact reconstruction. We study these problems and show how to apply them for the cases of substitutions and transpositions. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
11. Optimal Locally Repairable Codes Via Elliptic Curves.
- Author
-
Li, Xudong, Ma, Liming, and Xing, Chaoping
- Subjects
- *
CIPHERS , *MATHEMATICAL bounds , *ORDERED algebraic structures , *ELLIPTIC curves , *MEASUREMENT of distances - Abstract
Constructing locally repairable codes achieving Singleton-type bound (we call them optimal codes in this paper) is a challenging task and has attracted great attention in the last few years. Tamo and Barg first gave a breakthrough result in this topic by cleverly considering subcodes of Reed-Solomon codes. Thus, $q$ -ary optimal locally repairable codes from subcodes of Reed-Solomon codes given by Tamo and Barg have length upper bounded by $q$. Recently, it was shown through extension of construction by Tamo and Barg that length of $q$ -ary optimal locally repairable codes can be $q+1$ by Jin et al.. Surprisingly it was shown by Barg et al. that, unlike classical MDS codes, $q$ -ary optimal locally repairable codes could have length bigger than $q+1$. Thus, it becomes an interesting and challenging problem to construct $q$ -ary optimal locally repairable codes of length bigger than $q+1$. In this paper, we make use of rich algebraic structures of elliptic curves to construct a family of $q$ -ary optimal locally repairable codes of length up to $q+2\sqrt {q}$. It turns out that locality of our codes can be as big as 23 and distance can be linear in length. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
12. Binary LCD Codes and Self-Orthogonal Codes From a Generic Construction.
- Author
-
Zhou, Zhengchun, Li, Xia, Tang, Chunming, and Ding, Cunsheng
- Subjects
- *
LINEAR codes , *INJECTIONS , *POLYNOMIALS , *BINARY codes , *GENERIC drugs - Abstract
Linear codes with certain special properties have received renewed attention in recent years due to their practical applications. Among them, binary linear complementary dual (LCD) codes play an important role in implementations against side-channel attacks and fault injection attacks. Self-orthogonal codes can be used to construct quantum codes. In this paper, four classes of binary linear codes are constructed via a generic construction which has been intensively investigated in the past decade. Simple characterizations of these linear codes to be LCD or self-orthogonal are presented. Resultantly, infinite families of binary LCD codes and self-orthogonal codes are obtained. Infinite families of binary LCD codes from the duals of these four classes of linear codes are produced. Many LCD codes and self-orthogonal codes obtained in this paper are optimal or almost optimal in the sense that they meet certain bounds on general linear codes. In addition, the weight distributions of two sub-families of the proposed linear codes are established in terms of Krawtchouk polynomials. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
13. State-Dependent Gaussian Multiple Access Channels: New Outer Bounds and Capacity Results.
- Author
-
Yang, Wei, Liang, Yingbin, Shamai Shitz, Shlomo, and Poor, H. Vincent
- Subjects
- *
GAUSSIAN measures , *DATA transmission systems , *GAUSSIAN processes , *SIGNAL processing , *MEASURE theory , *COMPUTER security - Abstract
This paper studies a two-user state-dependent Gaussian multiple-access channel (MAC) with state noncausally known at one encoder. Two scenarios are considered: 1) each user wishes to communicate an independent message to the common receiver; and 2) the two encoders send a common message to the receiver and the non-cognitive encoder (i.e., the encoder that does not know the state) sends an independent individual message (this model is also known as the MAC with degraded message sets). For both scenarios, new outer bounds on the capacity region are derived, which improve uniformly over the best known outer bounds. In the first scenario, the two corner points of the capacity region as well as the sum rate capacity are established, and it is shown that a single-letter solution is adequate to achieve both the corner points and the sum rate capacity. Furthermore, the full capacity region is characterized in situations in which the sum rate capacity is equal to the capacity of the helper problem. The proof exploits the optimal-transportation idea of Polyanskiy and Wu (which was used previously to establish an outer bound on the capacity region of the interference channel) and the worst case Gaussian noise result for the case in which the input and the noise are dependent. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
14. Comments on Cut-Set Bounds on Network Function Computation.
- Author
-
Huang, Cupjin, Tan, Zihan, Yang, Shenghao, and Guang, Xuan
- Subjects
- *
LINEAR network coding , *COMPUTER systems , *INFORMATION theory , *TOPOLOGY , *MATHEMATICS - Abstract
A function computation problem over a directed acyclic network has been considered in the literature, where a sink node is required to compute a target function correctly with the inputs arbitrarily generated at multiple source nodes. The network links are error free but capacity limited, and the intermediate nodes perform network coding. The computing rate of a network code is the average number of times that the target function is computed for one use of the network, i.e., each link in the network is used at most once. In the existing papers, two cut-set bounds were proposed on the computing rate. However, we in this paper show that these bounds are not valid for general network function computation problems. We analyze the reason of the invalidity and propose a general cut-set bound by using a new equivalence relation associated with the inputs of the target function. Moreover, some results in the existing papers were proved by applying the invalid upper bound. We also justify the validity of these results. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
15. Bounds and Constructions of Locally Repairable Codes: Parity-Check Matrix Approach.
- Author
-
Hao, Jie, Xia, Shu-Tao, Shum, Kenneth W., Chen, Bin, Fu, Fang-Wei, and Yang, Yixian
- Subjects
- *
PARITY-check matrix , *TWO-dimensional bar codes , *LINEAR codes , *BINARY codes , *REED-Solomon codes - Abstract
A locally repairable code (LRC) is a linear code such that every code symbol can be recovered by accessing a small number of other code symbols. In this paper, we study bounds and constructions of LRCs from the viewpoint of parity-check matrices. Firstly, a simple and unified framework based on parity-check matrix to analyze the bounds of LRCs is proposed, and several new explicit bounds on the minimum distance of LRCs in terms of the field size are presented. In particular, we give an alternate proof of the Singleton-like bound for LRCs first proved by Gopalan et al. Some structural properties on optimal LRCs that achieve the Singleton-like bound are given. Then, we focus on constructions of optimal LRCs over the binary field. It is proved that there are only five classes of possible parameters with which optimal binary LRCs exist. Moreover, by employing the proposed parity-check matrix approach, we completely enumerate all these five classes of optimal binary LRCs attaining the Singleton-like bound in the sense of equivalence of linear codes. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
16. Constructions of Optimal Codes With Hierarchical Locality.
- Author
-
Zhang, Guanghui and Liu, Hongwei
- Subjects
- *
LINEAR codes , *REED-Muller codes , *REED-Solomon codes , *TASK analysis - Abstract
Locally repairable codes (LRCs) and codes with hierarchical locality (H-LRCs) have a great significance due to their applications in distributed storage systems. Constructing LRCs or H-LRCs achieving the Singleton-type bound is a challenging task and has received much attention. In this paper, we make use of optimal LRCs to construct a family of optimal H-LRCs. For this purpose we first construct a new class of optimal LRCs via generalized Reed-Solomon codes (GRS codes). Next, based on these optimal LRCs we present some new optimal H-LRCs, of which the parameters are more flexible than those given in and. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
17. Locally Recoverable Codes From Automorphism Group of Function Fields of Genus g ≥ 1.
- Author
-
Bartoli, Daniele, Montanucci, Maria, and Quoos, Luciane
- Subjects
- *
AUTOMORPHISM groups , *FINITE fields , *LINEAR codes , *HAMMING distance - Abstract
A Locally Recoverable Code is a code such that the value of any single coordinate of a codeword can be recovered from the values of a small subset of other coordinates. When we have $\delta $ non-overlapping subsets of cardinality $r_{i}$ that can be used to recover the missing coordinate we say that a linear code $\mathcal {C}$ with length $n$ , dimension $k$ , minimum distance $d$ has $(r_{1},\ldots, r_\delta)$ -locality and denote by $[n, k, d; r_{1}, r_{2}, {\dots }, r_\delta]$. In this paper we provide a new upper bound for the minimum distance of these codes. Working with a finite number of subgroups of cardinality $r_{i}+1$ of the automorphism group of a function field $\mathcal {F}| \mathbb {F}_{q}$ of genus $g \geq 1$ we propose a construction of $[n, k, d; r_{1}, r_{2}, {\dots }, r_\delta]$ -codes and apply the results to some well known families of function fields. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
18. Vector Network Coding Based on Subspace Codes Outperforms Scalar Linear Network Coding.
- Author
-
Etzion, Tuvi and Wachter-Zeh, Antonia
- Subjects
- *
LINEAR network coding , *MULTICASTING (Computer networks) , *VECTORS (Calculus) , *RECEIVING antennas , *ERROR messages (Computer science) - Abstract
This paper considers vector network coding solutions based on rank-metric codes and subspace codes. The main result of this paper is that vector solutions can significantly reduce the required alphabet size compared to the optimal scalar linear solution for the same multicast network. The multicast networks considered in this paper have one source with h messages, and the vector solution is over a field of size q with vectors of length t . For a given network, let the smallest field size for which the network has a scalar linear solution be , then the gap in the alphabet size between the vector solution and the scalar linear solution is defined to be q_{s}-q^{t} . In this contribution, the achieved gap is q^{(h-2)t^{2}/h + o(t)}$ for any q \geq 2$ and any even h \geq 4$ . If h \geq 5 . Previously, only a gap of size one had been shown for networks with a very large number of messages. These results imply the same gap of the alphabet size between the optimal scalar linear and some scalar nonlinear network coding solution for multicast networks. For three messages, we also show an advantage of vector network coding, while for two messages the problem remains open. Several networks are considered, all of them are generalizations and modifications of the well-known combination networks. The vector network codes that are used as solutions for those networks are based on subspace codes, particularly subspace codes obtained from rank-metric codes. Some of these codes form a new family of subspace codes, which poses a new research problem. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
19. Complementary Dual Algebraic Geometry Codes.
- Author
-
Mesnager, Sihem, Tang, Chunming, and Qi, Yanfeng
- Subjects
- *
ALGEBRAIC geometric codes , *INFORMATION storage & retrieval systems , *LINEAR codes , *LIQUID crystal displays , *HOUSEHOLD electronics , *ELLIPTIC curves - Abstract
Linear complementary dual (LCD) codes are a class of linear codes introduced by Massey in 1964. LCD codes have been extensively studied in literature recently. In addition to their applications in data storage, communications systems, and consumer electronics, LCD codes have been employed in cryptography. More specifically, it has been shown that LCD codes can also help improve the security of the information processed by sensitive devices, especially against so-called side-channel attacks (SCA) and fault non-invasive attacks. In this paper, we are interested in the construction of particular algebraic geometry LCD codes which could be good candidates to be resistant against SCA. We firstly provide a construction scheme for obtaining LCD codes from any algebraic curve. Then, some explicit LCD codes from elliptic curves are presented. Maximum distance separable (MDS) codes are of the most importance in coding theory due to their theoretical significance and practical interests. In this paper, all the constructed LCD codes from elliptic curves are MDS or almost MDS. Some infinite classes of LCD codes from elliptic curves are optimal due to the Griesmer bound. Finally, we also derive some explicit LCD codes from hyperelliptic curves and Hermitian curves. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
20. Sparse Representation in Fourier and Local Bases Using ProSparse: A Probabilistic Analysis.
- Author
-
Lu, Yue M., Onativia, Jon, and Dragotti, Pier Luigi
- Subjects
- *
SPARSE matrices , *COMPUTATIONAL complexity , *VANDERMONDE matrices , *COMPUTER algorithms , *PROBABILITY theory , *EMAIL systems - Abstract
Finding the sparse representation of a signal in an overcomplete dictionary has attracted a lot of attention over the past years. This paper studies ProSparse, a new polynomial complexity algorithm that solves the sparse representation problem when the underlying dictionary is the union of a Vandermonde matrix and a banded matrix. Unlike our previous work, which establishes deterministic (worst-case) sparsity bounds for ProSparse to succeed, this paper presents a probabilistic average-case analysis of the algorithm. Based on a generating-function approach, closed-form expressions for the exact success probabilities of ProSparse are given. The success probabilities are also analyzed in the high-dimensional regime. This asymptotic analysis characterizes a sharp phase transition phenomenon regarding the performance of the algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
21. The MIMO Wiretap Channel Decomposed.
- Author
-
Khina, Anatoly, Kochman, Yuval, and Khisti, Ashish
- Subjects
- *
MIMO systems , *WIRETAPPING , *TRIANGULARIZATION (Mathematics) , *GAUSSIAN channels , *WIRELESS communications - Abstract
The problem of sending a secret message over the Gaussian multiple-input multiple-output (MIMO) wiretap channel is studied. While the capacity of this channel is known, it is not clear how to construct optimal coding schemes that achieve this capacity. In this paper, we use linear operations along with successive interference cancellation to attain effective parallel single-antenna wiretap channels. By using independent scalar Gaussian wiretap codebooks over the resulting parallel channels, the capacity of the MIMO wiretap channel is achieved. The derivation of the schemes is based upon joint triangularization of the channel matrices. We find that the same technique can be used to rederive capacity expressions for the MIMO wiretap channel in a way that is simple and closely connected to a transmission scheme. This technique allows to extend the previously proven strong security for scalar Gaussian channels to the MIMO case. We further consider the problem of transmitting confidential messages over a two-user broadcast MIMO channel. For that problem, we find that derivation of both the capacity and a transmission scheme is a direct corollary of the proposed analysis for the MIMO wiretap channel. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
22. Construction of n -Variable ( n\equiv 2 \bmod 4 ) Balanced Boolean Functions With Maximum Absolute Value in Autocorrelation Spectra < 2^\frac n2.
- Author
-
Tang, Deng and Maitra, Subhamoy
- Subjects
- *
BOOLEAN functions , *CRYPTOGRAPHY , *BENT functions , *CODING theory , *AUTOCORRELATION (Statistics) - Abstract
In this paper, we consider the maximum absolute value \Delta f in the autocorrelation spectrum (not considering the zero point) of a function f . In an even number of variables n , bent functions possess the highest nonlinearity with \Delta f = 0 . The long standing open question (for two decades) in this area is to obtain a theoretical construction of balanced functions with \Delta f < 2^{n/2} . So far, there are only a few examples of such functions for n = 10, 14 , but no general construction technique is known. In this paper, we mathematically construct an infinite class of balanced Boolean functions on n variables having absolute indicator strictly lesser than \delta n = 2^{n/2}-2^{(({n+6})/{4})} , nonlinearity strictly greater than \rho n = 2^{n-1} - 2^{n/2} + 2^{n/2-3} - 5\cdot 2^{(({n-2})/{4})} and algebraic degree n-1 , where n\equiv 2 \pmod 4 and n\geq 46 . While the bound n \geq 46 is required for proving the generic result, our construction starts from n = 18 and nonlinearity > 2^n-1 - 2^n/2 for n = 18, 22 , and 26. [ABSTRACT FROM PUBLISHER]
- Published
- 2018
- Full Text
- View/download PDF
23. Classification of Bent Monomials, Constructions of Bent Multinomials and Upper Bounds on the Nonlinearity of Vectorial Functions.
- Author
-
Xu, Yuwei, Carlet, Claude, Mesnager, Sihem, and Wu, Chuankun
- Subjects
- *
NONLINEAR theories , *MATHEMATICAL bounds , *VECTOR algebra , *CODING theory - Abstract
This paper is composed of two main parts related to the nonlinearity of vectorial functions. The first part is devoted to maximally nonlinear (n,m) functions (the so-called bent vectorial functions), which contribute to an optimal resistance to both linear and differential attacks on symmetric cryptosystems. They can be used in block ciphers at the cost of additional diffusion/compression/expansion layers, or as building blocks for the construction of substitution boxes (S-boxes), and they are also useful for constructing robust codes and algebraic manipulation detection codes. A main issue on bent vectorial functions is to characterize bent monomial functions Tr_{m}^{n} (\lambda x^{d}) from \mathbb {F}_{2^{n}} to \mathbb F2^{m} (where m is a divisor of n ) leading to a classification of those bent monomials. We also treat the case of functions with multiple trace terms involving general results and explicit constructions. Furthermore, we investigate some open problems raised by Pasalic et al. and Muratović-Ribić et al. in a series of papers on vectorial functions. The second part is devoted to the nonlinearity of (n,m) -functions. No tight upper bound is known when \frac n2
- Published
- 2018
- Full Text
- View/download PDF
24. Asymptotics of Input-Constrained Erasure Channel Capacity.
- Author
-
Li, Yonglong and Han, Guangyue
- Subjects
- *
CODING theory , *ASYMPTOTIC distribution , *ASYMPTOTIC normality , *DISTRIBUTION (Probability theory) , *MARKOV processes - Abstract
In this paper, we examine an input-constrained erasure channel and we characterize the asymptotics of its capacity when the erasure rate is low. More specifically, for a general memoryless erasure channel with its input supported on an irreducible finite-type constraint, we derive partial asymptotics of its capacity, using some series expansion type formula of its mutual information rate; and for a binary erasure channel with its first-order Markovian input supported on the $(1, \infty )$ -RLL constraint based on the concavity of its mutual information rate with respect to some parameterization of the input, we numerically evaluate its first-order Markov capacity and further derive its full asymptotics. The asymptotics obtained in this paper, when compared with the recently derived feedback capacity for a binary erasure channel with the same input constraint, enable us to draw the conclusion that feedback may increase the capacity of an input-constrained channel, even if the channel is memoryless. [ABSTRACT FROM PUBLISHER]
- Published
- 2018
- Full Text
- View/download PDF
25. Narrow-Sense BCH Codes Over \mathrm GF(q) With Length n=\frac q^m-1q-1.
- Author
-
Li, Shuxing, Ding, Cunsheng, Xiong, Maosheng, and Ge, Gennian
- Subjects
- *
CYCLIC codes , *QUADRATIC forms , *BCH codes , *DECODING algorithms , *TELECOMMUNICATION systems - Abstract
Cyclic codes are widely employed in communication systems, storage devices, and consumer electronics, as they have efficient encoding and decoding algorithms. BCH codes, as a special subclass of cyclic codes, are in most cases among the best cyclic codes. A subclass of good BCH codes are the narrow-sense BCH codes over \mathrm GF(q) with length n=(q^m-1)/(q-1) . Little is known about this class of BCH codes when $q>2$ . The objective of this paper is to study some of the codes within this class. In particular, the dimension, the minimum distance, and the weight distribution of some ternary BCH codes with length n=(3^{m}-1)/2 are determined in this paper. A class of ternary BCH codes meeting the Griesmer bound is identified. An application of some of the BCH codes in secret sharing is also investigated. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
26. Asymptotically Equivalent Sequences of Matrices and Capacity of a Discrete-Time Gaussian MIMO Channel With Memory.
- Author
-
Gutierrez-Gutierrez, Jesus, Crespo, Pedro M., Zarraga-Rodriguez, Marta, and Hogstad, Bjorn Olav
- Subjects
- *
MIMO systems , *EMAIL systems , *GAUSSIAN channels , *NOISE measurement , *INFINITE impulse response filters - Abstract
Using some recent results on asymptotically equivalent sequences of matrices, we present in this paper, a new derivation of the capacity formula given by Brandenburg and Wyner for a discrete-time Gaussian multiple-input-multiple-output channel with memory. In this paper, we tackle not only the case considered by them, where the number of channel inputs and the number of channel outputs are the same, but also when both numbers are different. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
27. The Global Packing Number of a Fat-Tree Network.
- Author
-
Lo, Yuan-Hsun, Zhang, Yijin, Chen, Yi, Fu, Hung-Lin, and Wong, Wing Shing
- Subjects
- *
COMPUTER network resources , *DATA structures , *ROUTING (Computer network management) , *DATA libraries , *TREE graphs - Abstract
Data centers play an important role in today’s Internet development. Research to find scalable architecture and efficient routing algorithms for data center networks has gained popularity. The fat-tree architecture, which is essentially a folded version of a Clos network, has proved to be readily implementable and is scalable. In this paper, we investigate routing on a fat-tree network by deriving its global packing number and by presenting explicit algorithms for the construction of optimal, load-balanced routing solutions. Consider an optical network that employs wavelength division multiplexing in which every user node sets up a connection with every other user node. The global packing number is basically the number of wavelengths required by the network to support such a traffic load, under the restriction that each source-to-destination connection is assigned a wavelength that remains constant in the network. In mathematical terms, consider a bidirectional, simple graph, G and let N\subseteq V(G) be a set of nodes. A path system \mathcal P of G with respect to N consists of |N|(|N|-1) directed paths, one path to connect each of the source-destination node pairs in N . The global packing number of a path system , denoted by \Phi (G,N,\mathcal {P}) , is the minimum integer k to guarantee the existence of a mapping \phi :\mathcal P\to \1,2,\ldots, k\ , such that \phi (P)\neq \phi (\widehat P) if P and \widehat {P} have common arc(s). The global packing number of (G,N) , denoted by \Phi (G,N) , is defined to be the minimum \Phi (G,N,\mathcal {P}) among all possible path systems \mathcal {P} . In additional to wavelength division optical networks, this number also carries significance for networks employing time division multiple access. In this paper, we compute by explicit route construction the global packing number of (\text Tn,N) , where Tn denotes the topology of the n -ary fat-tree network, and $N$ is considered to be the set of all edge switches or the set of all supported hosts. We show that the constructed routes are load-balanced and require minimal link capacity at all network links. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
28. Minimal Linear Codes From Characteristic Functions.
- Author
-
Mesnager, Sihem, Qi, Yanfeng, Ru, Hongming, and Tang, Chunming
- Subjects
- *
LINEAR codes , *BOOLEAN functions , *CHARACTERISTIC functions , *HAMMING weight , *BINARY codes - Abstract
Minimal linear codes have interesting applications in secret sharing schemes and secure two-party computation. This paper uses characteristic functions of some subsets of $\mathbb {F}_{q}$ to construct minimal linear codes. By properties of characteristic functions, we can obtain more minimal binary linear codes from known minimal binary linear codes, which generalizes results of Ding et al. [IEEE Trans. Inf. Theory, vol. 64, no. 10, pp. 6536–6545, 2018]. By characteristic functions corresponding to some subspaces of $\mathbb {F}_{q}$ , we obtain many minimal linear codes, which generalizes results of [IEEE Trans. Inf. Theory, vol. 64, no. 10, pp. 6536–6545, 2018] and [IEEE Trans. Inf. Theory, vol. 65, no. 11, pp. 7067–7078, 2019]. Finally, we use characteristic functions to present a characterization of minimal linear codes from the defining set method and present a class of minimal linear codes. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
29. Rate-Constrained Shaping Codes for Structured Sources.
- Author
-
Liu, Yi, Huang, Pengfei, Bergman, Alexander W., and Siegel, Paul H.
- Subjects
- *
SOURCE code , *DATA warehousing , *FLASH memory , *POWER transmission , *DATA transmission systems - Abstract
Shaping codes are used to encode information for use on channels with cost constraints. Applications include data transmission with a power constraint and, more recently, data storage on flash memories with a constraint on memory cell wear. In the latter application, system requirements often impose a rate constraint. In this paper, we study rate-constrained fixed-to-variable length shaping codes for noiseless, memoryless costly channels and general i.i.d. sources. The analysis relies on the theory of word-valued sources. We establish a relationship between the code expansion factor – the ratio of the expected codeword length to the length of the input source word – and the minimum average symbol cost. We then determine the expansion factor that minimizes the average cost per source symbol (total cost), corresponding to a conventional optimal source code with cost. An equivalence is established between codes minimizing average symbol cost and codes minimizing total cost, and a separation theorem is proved, showing that optimal shaping can be achieved by a concatenation of optimal compression and optimal shaping for a uniform i.i.d. source. Shaping codes often incorporate, either explicitly or implicitly, some form of non-equiprobable signaling. We use our results to further explore the connections between shaping codes and codes that map a sequence of i.i.d. source symbols into an output sequence of symbols that are approximately independent and distributed according to a specified target distribution, such as distribution matching (DM) codes. Optimal DM codes are characterized in terms of a new performance measure - generalized expansion factor (GEF) - motivated by the costly channel perspective. The GEF is used to study DM codes that minimize informational divergence and normalized informational divergence. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
30. Second- and Third-Order Asymptotics of the Continuous-Time Poisson Channel.
- Author
-
Sakai, Yuta, Tan, Vincent Y. F., and Kovacevic, Mladen
- Subjects
- *
POISSON processes , *DEFINITIONS , *MEMORYLESS systems , *VIDEO coding - Abstract
The paper derives the optimal second-order coding rate for the continuous-time Poisson channel. We also obtain bounds on the third-order coding rate. This is the first instance of a second-order result for a continuous-time channel. The converse proof hinges on a novel construction of an output distribution induced by Wyner’s discretized channel and the construction of an appropriate $\epsilon $ -net of the input probability simplex. While the achievability proof follows the general program to prove the third-order term for non-singular discrete memoryless channels put forth by Polyanskiy, several non-standard techniques—such as new definitions and bounds on the probabilities of typical sets using logarithmic Sobolev inequalities—are employed to handle the continuous nature of the channel. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
31. A Channel-Aware Combinatorial Approach to Design High Performance Spatially-Coupled Codes.
- Author
-
Hareedy, Ahmed, Wu, Ruiyi, and Dolecek, Lara
- Subjects
- *
ERROR correction (Information theory) , *ADDITIVE white Gaussian noise , *ERROR-correcting codes , *BLOCK codes , *CHANNEL coding , *ITERATIVE decoding - Abstract
Because of their capacity-approaching performance and their complexity/latency advantages, spatially-coupled (SC) codes are among the most attractive error-correcting codes for use in modern dense data storage systems. SC codes are constructed by partitioning an underlying block code and coupling the partitioned components. Here, we focus on circulant-based SC codes. Recently, the optimal overlap (OO), circulant power optimizer (CPO) approach was introduced to construct high performance SC codes for additive white Gaussian noise (AWGN) and Flash channels. The OO stage operates on the protograph of the SC code to derive the optimal partitioning that minimizes the number of graphical objects that undermine the performance of SC codes under iterative decoding. Then, the CPO optimizes the circulant powers to further reduce this number. Since the nature of detrimental objects in the graph of a code critically depends on the characteristics of the channel of interest, extending the OO-CPO approach to construct SC codes for channels with intrinsic memory is not a straightforward task. In this paper, we tackle one relevant extension; we construct high performance SC codes for practical 1-D magnetic recording channels, i.e., partial-response (PR) channels. Via combinatorial techniques, we carefully build and solve the optimization problem of the OO partitioning, focusing on the objects of interest in the case of PR channels. Then, we customize the CPO to further reduce the number of these objects in the graph of the code. SC codes designed using the proposed OO-CPO approach for PR channels outperform prior state-of-the-art SC codes by up to around 3 orders of magnitude in frame error rate (FER) and 1.1 dB in signal-to-noise ratio (SNR). More intriguingly, our SC codes outperform structured block codes of the same length and rate by up to around 1.8 orders of magnitude in FER and 0.4 dB in SNR. The performance advantage of SC codes designed using the devised OO-CPO approach over block codes of the same parameters is not only pronounced in the error floor region, but also in the waterfall region. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
32. On Optimal Locally Repairable Codes With Super-Linear Length.
- Author
-
Cai, Han, Miao, Ying, Schwartz, Moshe, and Tang, Xiaohu
- Subjects
- *
HAMMING distance , *LINEAR codes , *CIPHERS , *STEINER systems - Abstract
In this paper, locally repairable codes which have optimal minimum Hamming distance with respect to the bound presented by Prakash et al. are considered. New upper bounds on the length of such optimal codes are derived. The new bounds apply to more general cases, and have weaker requirements compared with the known ones. In this sense, they both improve and generalize previously known bounds. Further, optimal codes are constructed, whose length is order-optimal with respect to the new upper bounds. Notably, the length of the codes is super-linear in the alphabet size. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
33. Adaptive Coded Caching for Fair Delivery Over Fading Channels.
- Author
-
Destounis, Apostolos, Ghorbel, Asma, Paschos, Georgios S., and Kobayashi, Mari
- Subjects
- *
RADIO transmitter fading , *LOCAL delivery services , *MULTICASTING (Computer networks) , *BROADCAST channels , *WIRELESS communications , *FAIRNESS - Abstract
The performance of existing coded caching schemes is sensitive to the worst channel quality, a problem which is exacerbated when communicating over fading channels. In this paper, we address this limitation in the following manner: in short-term, we allow transmissions to subsets of users with good channel quality, avoiding users with fades, while in long-term we ensure fairness among users. Our online scheme combines (i) the classical decentralized coded caching scheme with (ii) joint scheduling and power control for the fading broadcast channel, as well as (iii) congestion control for ensuring the optimal long-term average performance. We prove that our online delivery scheme maximizes the alpha-fair utility among all schemes restricted to decentralized placement. By tuning the value of alpha, the proposed scheme can achieve different operating points on the average delivery rate region and tune performance according to an operator’s choice. We demonstrate via simulations that our scheme outperforms two baseline schemes: (a) standard coded caching with multicast transmission, limited by the worst channel user yet exploiting the global caching gain; (b) opportunistic scheduling with unicast transmissions exploiting the fading diversity but limited to local caching gain. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
34. Several Classes of Minimal Linear Codes With Few Weights From Weakly Regular Plateaued Functions.
- Author
-
Mesnager, Sihem and Sinak, Ahmet
- Subjects
- *
FINITE fields , *INFORMATION theory , *HAMMING weight , *LINEAR codes - Abstract
Minimal linear codes have significant applications in secret sharing schemes and secure two-party computation. There are several methods to construct linear codes, one of which is based on functions over finite fields. Recently, many construction methods for linear codes from functions have been proposed in the literature. In this paper, we generalize the recent construction methods given by Tang et al. in [IEEE Transactions on Information Theory, 62(3), 1166-1176, 2016] to weakly regular plateaued functions over finite fields of odd characteristic. We first construct three-weight linear codes from weakly regular plateaued functions based on the second generic construction and then determine their weight distributions. We also give a punctured version and subcode of each constructed code. We note that they may be (almost) optimal codes and can be directly employed to obtain (democratic) secret sharing schemes, which have diverse applications in the industry. We next observe that the constructed codes are minimal for almost all cases and finally describe the access structures of the secret sharing schemes based on their dual codes. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
35. Graph Guessing Games and Non-Shannon Information Inequalities.
- Author
-
Baber, Rahil, Dang, Anh N., Vaughan, Emil R., Riis, Soren, and Christofides, Demetres
- Subjects
- *
COOPERATIVE game theory , *GUESSING games , *LINEAR network coding , *INFORMATION theory , *UNCERTAINTY (Information theory) , *DIRECTED graphs - Abstract
Guessing games for directed graphs were introduced by Riis for studying multiple unicast network coding problems. In a guessing game, the players toss generalised dice and can see some of the other outcomes depending on the structure of an underlying digraph. They later guess simultaneously the outcome of their own die. Their objective is to find a strategy, which maximizes the probability that they all guess correctly. The performance of the optimal strategy for a graph is measured by the guessing number of the digraph. Christofides and Markström studied guessing numbers of undirected graphs and defined a strategy which they conjectured to be optimal. One of the main results of this paper is a disproof of this conjecture. The main tool so far for computing guessing numbers of graphs is information theoretic inequalities. The other main result of this paper is that Shannon’s information inequalities, which work particularly well for a wide range of graph classes, are not sufficient for computing the guessing number. Finally, we pose a few more interesting questions some of which we can answer and some which we leave as open problems. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
36. LCD Cyclic Codes Over Finite Fields.
- Author
-
Li, Chengju, Ding, Cunsheng, and Li, Shuxing
- Subjects
- *
BCH codes , *CYCLIC codes , *FINITE fields , *CYCLOTOMIC fields , *LINEAR programming - Abstract
In addition to their applications in data storage, communications systems, and consumer electronics, linear complementary dual (LCD) codes—a class of linear codes—have been employed in cryptography recently. LCD cyclic codes were referred to as reversible cyclic codes in the literature. The objective of this paper is to construct several families of reversible cyclic codes over finite fields and analyze their parameters. The LCD cyclic codes presented in this paper have very good parameters in general, and contain many optimal codes. A well rounded treatment of reversible cyclic codes is also given in this paper. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
37. Zero-Difference Balanced Functions With New Parameters and Their Applications.
- Author
-
Cai, Han, Tang, Xiaohu, Zhou, Zhengchun, and Miao, Ying
- Subjects
- *
BOOLEAN functions , *CYCLOTOMY , *LINEAR codes , *SETS of pairs of functions to be distinguished , *ABELIAN groups - Abstract
As an optimal combinatorial object, zero-difference balanced (ZDB) functions introduced by Ding in 2008, are a generalization of the well-known perfect nonlinear functions. ZDB functions have received much attention in recent years due to its important applications in coding theory and sequence design. One objective of this paper is to present a construction of ZDB functions based on a kind of generalized cyclotomy. It generates ZDB functions over cyclic group with new parameters which can not be produced by earlier constructions. Another objective of this paper is to employ these ZDB functions to obtain at the same time: 1) optimal constant-composition codes; 2) perfect difference systems of sets; and 3) optimal frequency-hopping sequences, all with new parameters. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
38. Finite-Length Linear Schemes for Joint Source-Channel Coding Over Gaussian Broadcast Channels With Feedback.
- Author
-
Murin, Yonathan, Kaspi, Yonatan, Dabora, Ron, and Gunduz, Deniz
- Subjects
- *
CHANNEL coding , *TELECOMMUNICATION channels , *H2 control , *NOISE measurement , *BROADCASTING industry - Abstract
In this paper, we study linear encoding for a pair of correlated Gaussian sources transmitted over a two-user Gaussian broadcast channel in the presence of unit-delay noiseless feedback, abbreviated as the GBCF. Each pair of source samples is transmitted using a linear transmission scheme in a finite number of channel uses. We investigate three linear transmission schemes: A scheme based on the Ozarow–Leung (OL) code, a scheme based on the linear quadratic Gaussian (LQG) code of Ardestanizadeh et al., and a novel scheme derived in this paper using a dynamic programming (DP) approach. For the OL and LQG schemes we present lower and upper bounds on the minimal number of channel uses needed to achieve a target mean-square error (MSE) pair. For the LQG scheme in the symmetric setting, we identify the optimal scaling of the sources, which results in a significant improvement of its finite horizon performance, and, in addition, characterize the (exact) minimal number of channel uses required to achieve a target MSE. Finally, for the symmetric setting, we show that for any fixed and finite number of channel uses, the DP scheme achieves an MSE lower than the MSE achieved by either the LQG or the OL schemes. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
39. Deletion Codes in the High-Noise and High-Rate Regimes.
- Author
-
Guruswami, Venkatesan and Wang, Carol
- Subjects
- *
DELETION (Linguistics) , *ERROR correction (Information theory) , *CODING standards (Coding theory) , *BINARY sequences , *BINARY codes - Abstract
The noise model of deletions poses significant challenges in coding theory, with basic questions like the capacity of the binary deletion channel still being open. In this paper, we study the harder model of worst case deletions, with a focus on constructing efficiently decodable codes for the two extreme regimes of high-noise and high-rate. Specifically, we construct polynomial-time decodable codes with the following tradeoffs (for any \varepsilon > 0 ): 1) codes that can correct a fraction 1- \varepsilon of deletions with rate \mathop \mathrm poly\nolimits ( \varepsilon ) over an alphabet of size \mathop \mathrm poly\nolimits (1/ \varepsilon ) ; 2) binary codes of rate 1-\tilde O(\sqrt \varepsilon ) that can correct a fraction $ \varepsilon $ of deletions; and 3) Binary codes that can be list-decoded from a fraction (1/2- \varepsilon )$ of deletions with rate \mathop {\mathrm {poly}}\nolimits ( \varepsilon ) . This paper gives the first efficient constructions which meet the qualitative goals of correcting a deletion fraction approaching 1 over bounded alphabets, and correcting a constant fraction of bit deletions with rate approaching 1 over a fixed alphabet. The above-mentioned results bring our understanding of deletion code constructions in these regimes to a similar level as worst case errors. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
40. Codes Correcting a Burst of Deletions or Insertions.
- Author
-
Schoeny, Clayton, Wachter-Zeh, Antonia, Gabrys, Ryan, and Yaakobi, Eitan
- Subjects
- *
INSERTION loss (Telecommunication) , *DATA removal (Computer science) , *HAMMING codes , *REDUNDANCY in engineering , *TELECOMMUNICATION satellites - Abstract
This paper studies codes that correct a burst of deletions or insertions. Namely, a code will be called a $b$ -burst-deletion/insertion-correcting code if it can correct a burst of deletions/insertions of any $b$ consecutive bits. While the lower bound on the redundancy of such codes was shown by Levenshtein to be asymptotically $\log (n)+b-1$ , the redundancy of the best code construction by Cheng et al. is $b(\log (n/b+1))$ . In this paper, we close on this gap and provide codes with redundancy at most $\log (n) + (b-1)\log (\log (n)) +b -\log (b)$ . We first show that the models of insertions and deletions are equivalent and thus it is enough to study codes correcting a burst of deletions. We then derive a non-asymptotic upper bound on the size of $b$ -burst-deletion-correcting codes and extend the burst deletion model to two more cases: 1) a deletion burst of at most $b$ consecutive bits and 2) a deletion burst of size at most $b$ (not necessarily consecutive). We extend our code construction for the first case and study the second case for $b=3,4$ . [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
41. A Robust Generalized Chinese Remainder Theorem for Two Integers.
- Author
-
Li, Xiaoping, Xia, Xiang-Gen, Wang, Wenjie, and Wang, Wei
- Subjects
- *
CHINESE remainder theorem , *MODULI theory , *CONGRUENCES & residues , *RING theory , *ALGEBRAIC geometry - Abstract
A generalized Chinese remainder theorem (CRT) for multiple integers from residue sets has been studied recently, where the correspondence between the remainders and the integers in each residue set modulo several moduli is not known. A robust CRT has also been proposed lately to robustly reconstruct a single integer from its erroneous remainders. In this paper, we consider the reconstruction problem of two integers from their residue sets, where the remainders not only are out of order but also may have errors. We prove that two integers can be robustly reconstructed if their remainder errors are less than $M/8$ , where $M$ is the greatest common divisor of all the moduli. We also propose an efficient reconstruction algorithm. Finally, we present some simulations to verify the efficiency of the proposed algorithm. This paper is motivated from and has applications in the determination of multiple frequencies from multiple undersampled waveforms. [ABSTRACT FROM PUBLISHER]
- Published
- 2016
- Full Text
- View/download PDF
42. New Bounds on the Number of Tests for Disjunct Matrices.
- Author
-
Shangguan, Chong and Ge, Gennian
- Subjects
- *
BINARY codes , *DISJUNCTION (Logic) , *PROPOSITION (Logic) , *GROUP testing , *CODING theory - Abstract
Given n items with at most d of which being positive, instead of testing these items individually, the theory of combinatorial group testing aims to identify all positive items using as few tests as possible. This paper is devoted to a fundamental and thirty-year-old problem in the nonadaptive group testing theory. A binary matrix is called d -disjunct if the Boolean sum of arbitrary d columns does not contain another column not in this collection. Let T(d) denote the minimal t , such that there exists a t\times n\,\,d -disjunct matrix with n>t and was conjectured that T(d)\ge (d+1)^{2} . In this paper, we narrow the gap by proving T(d)/d^{2}\ge (15+\sqrt {33})/24$ , a quantity in [6/7,7/8]. [ABSTRACT FROM PUBLISHER]
- Published
- 2016
- Full Text
- View/download PDF
43. State Amplification Subject to Masking Constraints.
- Author
-
Koyluoglu, Onur Ozan, Soundararajan, Rajiv, and Vishwanath, Sriram
- Subjects
- *
MASKING (Psychology) , *BROADCAST channels , *CONFIDENTIAL communications , *CODING theory , *DATA security failures - Abstract
This paper considers a state dependent broadcast channel with one transmitter, Alice, and two receivers, Bob and Eve. The problem is to effectively convey (“amplify”) the channel state sequence to Bob while “masking” it from Eve. The extent to which the state sequence cannot be masked from Eve is referred to as leakage. This can be viewed as a secrecy problem, where we desire that the channel state itself be minimally leaked to Eve while being communicated to Bob. This paper is aimed at characterizing the tradeoff region between amplification and leakage rates for such a system. An achievable coding scheme is presented, wherein the transmitter transmits a partial state information over the channel to facilitate the amplification process. For the case when Bob observes a stronger signal than Eve, the achievable coding scheme is enhanced with secure refinement. Outer bounds on the tradeoff region are also derived, and used in characterizing some special case results. In particular, the optimal amplification-leakage rate difference, called as differential amplification capacity, is characterized for the reversely degraded discrete memoryless channel, the degraded binary, and the degraded Gaussian channels. In addition, for the degraded Gaussian model, the extremal corner points of the tradeoff region are characterized, and the gap between the outer bound and achievable rate-regions is shown to be less than half a bit for a wide set of channel parameters. [ABSTRACT FROM PUBLISHER]
- Published
- 2016
- Full Text
- View/download PDF
44. On the Combinatorics of Locally Repairable Codes via Matroid Theory.
- Author
-
Westerback, Thomas, Freij-Hollanti, Ragnar, Ernvall, Toni, and Hollanti, Camilla
- Subjects
- *
COMBINATORICS , *COMBINATORIAL probabilities , *COMBINATORIAL group theory , *MATROIDS , *LINEAR dependence (Mathematics) - Abstract
This paper provides a link between matroid theory and locally repairable codes (LRCs) that are either linear or more generally almost affine. Using this link, new results on both LRCs and matroid theory are derived. The parameters $(n,k,d,r,\delta )$ of LRCs are generalized to matroids, and the matroid analog of the generalized singleton bound by Gopalan et al. for linear LRCs is given for matroids. It is shown that the given bound is not tight for certain classes of parameters, implying a nonexistence result for the corresponding locally repairable almost affine codes that are coined perfect in this paper. Constructions of classes of matroids with a large span of the parameters $(n,k,d,r,\delta )$ and the corresponding local repair sets are given. Using these matroid constructions, new LRCs are constructed with prescribed parameters. The existence results on linear LRCs and the nonexistence results on almost affine LRCs given in this paper strengthen the nonexistence and existence results on perfect linear LRCs given by Song et al. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
45. A Characterization of Guesswork on Swiftly Tilting Curves.
- Author
-
Beirami, Ahmad, Calderbank, Robert, Christiansen, Mark M., Duffy, Ken R., and Medard, Muriel
- Subjects
- *
MAXIMUM likelihood decoding , *SEQUENTIAL decoding , *COMPUTATIONAL complexity , *CHANNEL coding , *DECODING algorithms - Abstract
Given a collection of strings, each with an associated probability of occurrence, the guesswork of each of them is their position in a list ordered from most likely to least likely, breaking ties arbitrarily. The guesswork is central to several applications in information theory: average guesswork provides a lower bound on the expected computational cost of a sequential decoder to decode successfully the transmitted message; the complementary cumulative distribution function of guesswork gives the error probability in list decoding; the logarithm of guesswork is the number of bits needed in optimal lossless one-to-one source coding; and the guesswork is the number of trials required of an adversary to breach a password protected system in a brute-force attack. In this paper, we consider memoryless string sources that generate strings consisting of independent and identically distributed characters drawn from a finite alphabet, and characterize their corresponding guesswork. Our main tool is the tilt operation on a memoryless string source. We show that the tilt operation on a memoryless string source parametrizes an exponential family of memoryless string sources, which we refer to as the tilted family of the string source. We provide an operational meaning to the tilted families by proving that two memoryless string sources result in the same guesswork on all strings of all lengths if and only if their respective categorical distributions belong to the same tilted family. Establishing some general properties of the tilt operation, we generalize the notions of weakly typical set and asymptotic equipartition property to tilted weakly typical sets of different orders. We use this new definition to characterize the large deviations for all atypical strings and characterize the volume of tilted weakly typical sets of different orders. We subsequently build on this characterization to prove large deviation bounds on guesswork and provide an accurate approximation of its probability mass function. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
46. MDS Codes With Hulls of Arbitrary Dimensions and Their Quantum Error Correction.
- Author
-
Luo, Gaojun, Cao, Xiwang, and Chen, Xiaojing
- Subjects
- *
HAMMING codes , *QUANTUM entanglement , *LINEAR codes , *REED-Solomon codes , *ERROR-correcting codes - Abstract
The hull of linear codes has promising utilization in coding theory and quantum coding theory. In this paper, we study the hull of generalized Reed–Solomon codes and extended generalized Reed–Solomon codes over finite fields with respect to the Euclidean inner product. Several infinite families of MDS codes with hulls of arbitrary dimensions are presented. As an application, using these MDS codes with hulls of arbitrary dimensions, we construct several new infinite families of entanglement-assisted quantum error-correcting codes with flexible parameters. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
47. Mixture Models, Bayes Fisher Information, and Divergence Measures.
- Author
-
Asadi, Majid, Kharazmi, Omid, Ebrahimi, Nader, and Soofi, Ehsan S.
- Subjects
- *
INFORMATION theory , *FISHER information , *DIVERGENCE theorem , *MIXTURE distributions (Probability theory) , *PROBABILITY theory - Abstract
This paper presents the Bayes Fisher information measures, defined by the expected Fisher information under a distribution for the parameter, for the arithmetic, geometric, and generalized mixtures of two probability density functions. The Fisher information of the arithmetic mixture about the mixing parameter is related to chi-square divergence, Shannon entropy, and the Jensen–Shannon divergence. The Bayes Fisher measures of the three mixture models are related to the Kullback–Leibler, Jeffreys, Jensen–Shannon, Rényi, and Tsallis divergences. These measures indicate that the farther away are the components from each other, the more informative are data about the mixing parameter. We also unify three different relative entropy derivations of the geometric mixture scattered in statistics and physics literatures. Extensions of two of the formulations to the minimization of Tsallis divergence give the generalized mixture as the solution. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
48. Subcovers and Codes on a Class of Trace-Defining Curves.
- Author
-
Borges Filho, Herivelto Martins, Castellanos, Alonso Sepulveda, and Tizziotti, Guilherme Chaud
- Subjects
- *
FINITE fields , *WEIERSTRASS semigroups , *AUTOMORPHISMS , *POLYNOMIALS , *RIEMANN-Roch theorems - Abstract
In this paper, we construct some class of explicit subcovers of the curve $\mathcal {X}_{n,r}$ defined over $\mathbb {F}_{q^{n}}$ by affine equation $y^{q^{n-1}}+\cdots +y^{q}+y=x^{q^{n-r}+1}-x^{q^{n}+q^{n-r}}$. These subcovers are defined over $\mathbb {F}_{q^{n}}$ by affine equation $g_{s}(y)=x^{q^{n}+q^{n-r}}-x^{q^{n-r}+1}$ , where $g_{s}(y)$ is a $q$ -polynomial of degree $q^{s}$. The Weierstrass semigroup $H(P_\infty)$ , where $P_\infty $ is the only point at infinity on such subcovers, is determined for $1 \leq s \leq 2r-n+1$ , and the corresponding one-point AG codes are investigated. Codes establishing new records on the parameters with respect to the previously known ones are discovered, and 108 improvements on MinT tables are obtained. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
49. On the Evaluation of Marton’s Inner Bound for Two-Receiver Broadcast Channels.
- Author
-
Anantharam, Venkat, Gohari, Amin, and Nair, Chandra
- Subjects
- *
BROADCAST channels , *NUMERICAL analysis , *PERTURBATION theory , *BINARY codes , *MATHEMATICAL analysis - Abstract
Marton’s inner bound is the best known achievable rate region for a general two-receiver discrete memoryless broadcast channel. In this paper, we establish improved bounds on the cardinalities of the auxiliary random variables appearing in this inner bound to the true rate region. We combine a perturbation technique, along with a representation using concave envelopes of information-theoretic functions that involve the use of auxiliary random variables, to achieve this improvement. The new cardinality bounds lead to a proof that a randomized-time-division strategy achieves every rate triple in Marton’s region for binary input broadcast channels. This extends the result by Hajek and Pursley which showed that the Cover-van der Muelen region was exhausted by the randomized-time-division strategy. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
50. List-Decodable Zero-Rate Codes.
- Author
-
Alon, Noga, Bukh, Boris, and Polyanskiy, Yury
- Subjects
- *
ERROR correction (Information theory) , *HAMMING distance , *HADAMARD matrices , *MATHEMATICS theorems , *NANOPARTICLES - Abstract
We consider list decoding in the zero-rate regime for two cases—the binary alphabet and the spherical codes in Euclidean space. Specifically, we study the maximal $\tau \in [{0,1}]$ for which there exists an arrangement of $M$ balls of relative Hamming radius $\tau $ in the binary hypercube (of arbitrary dimension) with the property that no point of the latter is covered by $L$ or more of them. As $M\to \infty $ the maximal $\tau $ decreases to a well-known critical value $\tau _{L}$. In this paper, we prove several results on the rate of this convergence. For the binary case, we show that the rate is $\Theta (M^{-1})$ when $L$ is even, thus extending the classical results of Plotkin and Levenshtein for $L=2$. For $L=3$ , the rate is shown to be $\Theta (M^{-({2}/{3})})$. For the similar question about spherical codes, we prove the rate is $\Omega (M^{-1})$ and $O(M^{-({2L}/{L^{2}-L+2})})$. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.