8
8.0

Jun 30, 2018
06/18

by
A Mani

texts

#
eye 8

#
favorite 0

#
comment 0

Lattice-theoretic ideals have been used to define and generate non granular rough approximations over general approximation spaces over the last few years by few authors. The goal of these studies, in relation based rough sets, have been to obtain nice properties comparable to those of classical rough approximations. In this research paper, these ideas are generalized in a severe way by the present author and associated semantic features are investigated by her. Granules are used in the...

Topics: Logic, Computing Research Repository, Information Theory, Logic in Computer Science, Artificial...

Source: http://arxiv.org/abs/1704.05477

24
24

Jun 28, 2018
06/18

by
A. A. Nasir; S. Durrani; H. Mehrpouyan; S. D. Blostein; R. A. Kennedy

texts

#
eye 24

#
favorite 0

#
comment 0

Timing and carrier synchronization is a fundamental requirement for any wireless communication system to work properly. Timing synchronization is the process by which a receiver node determines the correct instants of time at which to sample the incoming signal. Carrier synchronization is the process by which a receiver adapts the frequency and phase of its local carrier oscillator with those of the received signal. In this paper, we survey the literature over the last five years (2010-2014)...

Topics: Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1507.02032

4
4.0

Jun 29, 2018
06/18

by
A. A. Panarin; A. V. Reznichenko; I. S. Terekhov

texts

#
eye 4

#
favorite 0

#
comment 0

We consider the optical fiber channel modelled by the nonlinear Shr\"{o}dinger equation with zero dispersion and additive Gaussian noise. Using Feynman path-integral approach for the model we find corrections to conditional probability density function, output signal distribution, conditional and output signal entropies, and the channel capacity at large signal-to-noise ratio. We demonstrate that the correction to the channel capacity is positive for large signal power. Therefore, this...

Topics: Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1610.00906

6
6.0

Jun 30, 2018
06/18

by
A. Amorim Pereira; R. Sampaio-Neto

texts

#
eye 6

#
favorite 0

#
comment 0

Massive Multiple-input Multiple-output (MIMO) systems offer exciting opportunities due to their high spectral efficiencies capabilities. On the other hand, one major issue in these scenarios is the high-complexity detectors of such systems. In this work, we present a low-complexity, near maximum-likelihood (ML) performance achieving detector for the uplink in large MIMO systems with tens to hundreds of antennas at the base station (BS) and similar number of uplink users. The proposed algorithm...

Topics: Networking and Internet Architecture, Mathematics, Computing Research Repository, Information Theory

Source: http://arxiv.org/abs/1412.6118

11
11

Jun 27, 2018
06/18

by
A. Ben Hamza

texts

#
eye 11

#
favorite 0

#
comment 0

In this paper we introduce a nonextensive quantum information theoretic measure which may be defined between any arbitrary number of density matrices, and we analyze its fundamental properties in the spectral graph-theoretic framework. Unlike other entropic measures, the proposed quantum divergence is symmetric, matrix-convex, theoretically upper-bounded, and has the advantage of being generalizable to any arbitrary number of density matrices, with a possibility of assigning weights to these...

Topics: Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1504.01799

3
3.0

Jun 29, 2018
06/18

by
A. Borumand Saeid; Cristina Flaut; Sarka Hoskova-Mayerova; Roxana-Lavinia Cristea; M. Afshar; M. Kuchaki Rafsanjani

texts

#
eye 3

#
favorite 0

#
comment 0

In the last time some papers were devoted to the study of the con- nections between binary block codes and BCK-algebras. In this paper, we try to generalize these results to n-ary block codes, providing an algorithm which allows us to construct a BCK-algebra from a given n-ary block code.

Topics: Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1608.03684

4
4.0

Jun 30, 2018
06/18

by
A. Borumand Saeid; H. Fatemidokht; C. Flaut; M. Kuchaki Rafsanjani

texts

#
eye 4

#
favorite 0

#
comment 0

In this paper, we present some new connections between BCK- algebras and binary block codes.

Topics: Mathematics, Computing Research Repository, Information Theory

Source: http://arxiv.org/abs/1412.8395

7
7.0

Jun 30, 2018
06/18

by
A. D'yachkov; V. Rykov; C. Deppe; V. Lebedev

texts

#
eye 7

#
favorite 0

#
comment 0

We will discuss superimposed codes and non-adaptive group testing designs arising from the potentialities of compressed genotyping models in molecular biology. The given paper was motivated by the 30th anniversary of D'yachkov-Rykov recurrent upper bound on the rate of superimposed codes published in 1982. We were also inspired by recent results obtained for non-adaptive threshold group testing which develop the theory of superimposed codes

Topics: Mathematics, Computing Research Repository, Information Theory

Source: http://arxiv.org/abs/1401.7485

6
6.0

Jun 29, 2018
06/18

by
A. Dadkhah; M. S. Moslehian

texts

#
eye 6

#
favorite 0

#
comment 0

We present some generalizations of quantum information inequalities involving tracial positive linear maps between $C^*$-algebras. Among several results, we establish a noncommutative Heisenberg uncertainty relation. More precisely, we show that if $\Phi: \mathcal{A} \to \mathcal{B}$ is a tracial positive linear map between $C^*$-algebras , $\rho \in \mathcal{A}$ is a $\Phi$-density element and $A,B$ are self-adjoint operators of $\mathcal{A}$ such that $ {\rm...

Topics: Functional Analysis, Mathematics, Information Theory, Mathematical Physics, Operator Algebras,...

Source: http://arxiv.org/abs/1610.03929

11
11

Jun 30, 2018
06/18

by
A. Dyachkov

texts

#
eye 11

#
favorite 0

#
comment 0

For $q$-ary $n$-sequences, we develop the concept of similarity functions that can be used (for $q=4$) to model a thermodynamic similarity on DNA sequences. A similarity function is identified by the length of a longest common subsequence between two $q$-ary $n$-sequences. Codes based on similarity functions are called DNA codes. DNA codes are important components in biomolecular computing and other biotechnical applications that employ DNA hybridization assays. The main aim of the given...

Topics: Mathematics, Quantitative Methods, Computing Research Repository, Information Theory, Quantitative...

Source: http://arxiv.org/abs/1401.7492

3
3.0

Jun 29, 2018
06/18

by
A. Fotue Tabue; E. Martínez-Moro; C. Mouaha

texts

#
eye 3

#
favorite 0

#
comment 0

Given $\texttt{S}|\texttt{R}$ a finite Galois extension of finite chain rings and $\mathcal{B}$ an $\texttt{S}$-linear code we define two Galois operators, the closure operator and the interior operator. We proof that a linear code is Galois invariant if and only if the row standard form of its generator matrix has all entries in the fixed ring by the Galois group and show a Galois correspondence in the class of $\texttt{S}$-linear codes. As applications some improvements of upper and lower...

Topics: Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1602.01242

7
7.0

Jun 30, 2018
06/18

by
A. G. D'yachkov; A. J. Macula; D. C. Torney; P. A. Vilenkin

texts

#
eye 7

#
favorite 0

#
comment 0

We discuss two non-standard models of nonadaptive combinatorial search which develop the conventional disjunct search model for a small number of defective elements contained in a finite ground set or a population. The first model is called a search of defective supersets. The second model is called a search of defective subsets in the presence of inhibitors. For these models, we study the constructive search methods based on the known constructions for the disjunct model.

Topics: Mathematics, Computing Research Repository, Information Theory

Source: http://arxiv.org/abs/1401.7508

16
16

Jun 29, 2018
06/18

by
A. G. D'yachkov; I. V. Vorobyev; N. A. Polyanskii; V. Yu. Shchukin

texts

#
eye 16

#
favorite 0

#
comment 0

Learning a hidden hypergraph is a natural generalization of the classical group testing problem that consists in detecting unknown hypergraph $H_{un}=H(V,E)$ by carrying out edge-detecting tests. In the given paper we focus our attention only on a specific family $\mathcal{F}(t,s,\ell)$ of localized hypergraphs for which the total number of vertices $|V| = t$, the number of edges $|E|\le s$, $s\ll t$, and the cardinality of any edge $|e|\le\ell$, $\ell\ll t$. Our goal is to identify all edges...

Topics: Information Theory, Data Structures and Algorithms, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1607.00507

5
5.0

Jun 29, 2018
06/18

by
A. G. D'yachkov; I. V. Vorobyev; N. A. Polyanskii; V. Yu. Shchukin

texts

#
eye 5

#
favorite 0

#
comment 0

Let $1 \le s < t$, $N \ge 1$ be integers and a complex electronic circuit of size $t$ is said to be an $s$-active, $\; s \ll t$, and can work as a system block if not more than $s$ elements of the circuit are defective. Otherwise, the circuit is said to be an $s$-defective and should be substituted for the similar $s$-active circuit. Suppose that there exists a possibility to check the $s$-activity of the circuit using $N$ non-adaptive group tests identified by a conventional disjunctive...

Topics: Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1601.06709

3
3.0

Jun 29, 2018
06/18

by
A. G. D'yachkov; I. V. Vorobyev; N. A. Polyanskii; V. Yu. Shchukin

texts

#
eye 3

#
favorite 0

#
comment 0

Group testing is a well known search problem that consists in detecting up to $s$ defective elements of the set $[t]=\{1,\ldots,t\}$ by carrying out tests on properly chosen subsets of $[t]$. In classical group testing the goal is to find all defective elements by using the minimal possible number of tests. In this paper we consider multistage group testing. We propose a general idea how to use a hypergraph approach to searching defects. For the case $s=2$, we design an explicit construction,...

Topics: Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1607.00511

6
6.0

Jun 29, 2018
06/18

by
A. G. D'yachkov; I. V. Vorobyev; N. A. Polyanskii; V. Yu. Shchukin

texts

#
eye 6

#
favorite 0

#
comment 0

Let $1 \le s < t$, $N \ge 1$ be integers and a complex electronic circuit of size $t$ is said to be an $s$-active, $\; s \ll t$, and can work as a system block if not more than $s$ elements of the circuit are defective. Otherwise, the circuit is said to be an $s$-defective and should be replaced by a similar $s$-active circuit. Suppose that there exists a possibility to run $N$ non-adaptive group tests to check the $s$-activity of the circuit. As usual, we say that a (disjunctive) group test...

Topics: Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1607.00502

6
6.0

Jun 30, 2018
06/18

by
A. G. D'yachkov; I. V. Vorobyev; N. A. Polyanskii; V. Yu. Shchukin

texts

#
eye 6

#
favorite 0

#
comment 0

Let $1 \le s < t$, $N \ge 1$ be fixed integers and a complex electronic circuit of size $t$ is said to be an $s$-active, $\; s \ll t$, and can work as a system block if not more than $s$ elements of the circuit are defective. Otherwise, the circuit is said to be an $s$-defective and should be replaced by a similar $s$-active circuit. Suppose that there exists a possibility to run $N$ non-adaptive group tests to check the $s$-activity of the circuit. As usual, we say that a (disjunctive)...

Topics: Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1701.06201

4
4.0

Jun 29, 2018
06/18

by
A. G. D'yachkov; I. V. Vorobyev; N. A. Polyanskii; V. Yu. Shchukin

texts

#
eye 4

#
favorite 0

#
comment 0

Learning a hidden hypergraph is a natural generalization of the classical group testing problem that consists in detecting unknown hypergraph $H_{un}=H(V,E)$ by carrying out edge-detecting tests. In the given paper we focus our attention only on a specific family $F(t,s,\ell)$ of localized hypergraphs for which the total number of vertices $|V| = t$, the number of edges $|E|\le s$, $s\ll t$, and the cardinality of any edge $|e|\le\ell$, $\ell\ll t$. Our goal is to identify all edges of...

Topics: Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1601.06705

6
6.0

Jun 29, 2018
06/18

by
A. G. D'yachkov; I. V. Vorobyev; N. A. Polyanskii; V. Yu. Shchukin

texts

#
eye 6

#
favorite 0

#
comment 0

Group testing is a well known search problem that consists in detecting up to $s$ defective elements of the set $[t]=\{1,\ldots,t\}$ by carrying out tests on properly chosen subsets of $[t]$. In classical group testing the goal is to find all defective elements by using the minimal possible number of tests. In this paper we consider multistage group testing. We propose a general idea how to use a hypergraph approach to searching defects. For the case $s=2$, we design an explicit construction,...

Topics: Information Theory, Combinatorics, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1601.06704

5
5.0

Jun 29, 2018
06/18

by
A. G. D'yachkov; I. V. Vorobyev; N. A. Polyanskii; V. Yu. Shchukin

texts

#
eye 5

#
favorite 0

#
comment 0

We give a method of constructing a cover-free $(s, \ell)$-code. For $k > s$, our construction yields a $ {{n \choose s} \choose \ell}\times {n \choose k}$ cover-free $(s, \ell)$-code with a constant column weight.

Topics: Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1605.06847

3
3.0

Jun 30, 2018
06/18

by
A. G. D. Uchoa; C. T. Healy; R. C. de Lamare

texts

#
eye 3

#
favorite 0

#
comment 0

Irregular repeat-accumulate Root-Check LDPC codes based on Progressive Edge Growth (PEG) techniques for block-fading channels are proposed. The proposed Root-Check LDPC codes are {both suitable for channels under $F = 2, 3$ independent fadings per codeword and} for fast fading channels. An IRA(A) Root-Check structure is devised for $F = 2, 3$ independent fadings. The performance of the new codes is investigated in terms of the Frame Error Rate (FER). Numerical results show that the IRAA LDPC...

Topics: Mathematics, Computing Research Repository, Information Theory

Source: http://arxiv.org/abs/1402.5692

3
3.0

Jun 30, 2018
06/18

by
A. G. D. Uchoa; C. T. Healy; R. C. de Lamare; P. Li

texts

#
eye 3

#
favorite 0

#
comment 0

We propose an Iterative Detection and Decoding (IDD) scheme with Low Density Parity Check (LDPC) codes for Multiple Input Multiple Output (MIMO) systems for block-fading $F = 2$ and fast fading Rayleigh channels. An IDD receiver with soft information processing that exploits the code structure and the behaviour of the log likelihood ratios (LLR)'s is developed. Minimum Mean Square Error (MMSE) with Successive Interference Cancellation (SIC) and with Parallel Interference Cancellation (PIC)...

Topics: Mathematics, Computing Research Repository, Information Theory

Source: http://arxiv.org/abs/1404.1981

6
6.0

Jun 30, 2018
06/18

by
A. G. Dyachkov; I. V. Vorobyev; N. A. Polyanskii; V. Yu. Shchukin

texts

#
eye 6

#
favorite 0

#
comment 0

A binary code is said to be a disjunctive list-decoding $s_L$-code, $s\ge1$, $L\ge1$, (briefly, LD $s_L$-code) if the code is identified by the incidence matrix of a family of finite sets in which the union of any $s$ sets can cover not more than $L-1$ other sets of the family. In this paper, we introduce a natural {\em probabilistic} generalization of LD $s_L$-code when the code is said to be an almost disjunctive LD $s_L$-code if the unions of {\em almost all} $s$ sets satisfy the given...

Topics: Mathematics, Computing Research Repository, Information Theory

Source: http://arxiv.org/abs/1407.2482

4
4.0

Jun 29, 2018
06/18

by
A. G. Dyachkov; N. Polyanskii; V. Shchukin; I. Vorobyev

texts

#
eye 4

#
favorite 0

#
comment 0

A binary code is called a superimposed cover-free $(s,\ell)$-code if the code is identified by the incidence matrix of a family of finite sets in which no intersection of $\ell$ sets is covered by the union of $s$ others. A binary code is called a superimposed list-decoding $s_L$-code if the code is identified by the incidence matrix of a family of finite sets in which the union of any $s$ sets can cover not more than $L-1$ other sets of the family. For $L=\ell=1$, both of the definitions...

Topics: Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1605.05363

3
3.0

Jun 30, 2018
06/18

by
A. G. Dyachkov; N. Polyanskii; V. Shchukin; I. Vorobyev

texts

#
eye 3

#
favorite 0

#
comment 0

We discuss upper and lower bounds of zero error capacity for signature coding models based on the symmetric noiseless multiple access channel.

Topics: Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1701.06085

8
8.0

Jun 30, 2018
06/18

by
A. G. Ramm; C. Van

texts

#
eye 8

#
favorite 0

#
comment 0

Suppose the data consist of a set $S$ of points $x_j, 1 \leq j \leq J$, distributed in a bounded domain $D \subset R^N$, where $N$ and $J$ are large numbers. In this paper an algorithm is proposed for checking whether there exists a manifold $\mathbb{M}$ of low dimension near which many of the points of $S$ lie and finding such $\mathbb{M}$ if it exists. There are many dimension reduction algorithms, both linear and non-linear. Our algorithm is simple to implement and has some advantages...

Topics: Learning, Computing Research Repository, Machine Learning, Information Theory, Statistics,...

Source: http://arxiv.org/abs/1702.00027

5
5.0

Jun 28, 2018
06/18

by
A. Hansen; A. Montina; S. Wolf

texts

#
eye 5

#
favorite 0

#
comment 0

A two-party quantum communication process with classical inputs and outcomes can be simulated by replacing the quantum channel with a classical one. The minimal amount of classical communication required to reproduce the statistics of the quantum process is called its communication complexity. In the case of many instances simulated in parallel, the minimal communication cost per instance is called the asymptotic communication complexity. Previously, we reduced the computation of the asymptotic...

Topics: Quantum Physics, Information Theory, Optimization and Control, Computing Research Repository,...

Source: http://arxiv.org/abs/1512.03257

10
10.0

Jun 27, 2018
06/18

by
A. M. Fouladgar; O. Simeone; O. Sahin; P. Popovski; S. Shamai

texts

#
eye 10

#
favorite 0

#
comment 0

By means of the emerging technique of dynamic Time Division Duplex (TDD), the switching point between uplink and downlink transmissions can be optimized across a multi-cell system in order to reduce the impact of inter-cell interference. It has been recently recognized that optimizing also the order in which uplink and downlink transmissions, or more generally the two directions of a two-way link, are scheduled can lead to significant benefits in terms of interference reduction. In this work,...

Topics: Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1505.01222

836
836

Feb 8, 2022
02/22

by
A. M. Yaglom; I. M. Yaglom

texts

#
eye 836

#
favorite 5

#
comment 0

The present book, designed fora wide circle of readers (familiarity with math ematics up to high school level suffices for comprehension of all of its contents), makes, of course, no claim to serve even as an elementary introduction to the scientific information theory. We can give here only a preliminary idea of import ant practical applications of this theory. Similarly, it shall not be possible to deal here with the deeper purely mathematical problems connected with the in formation...

Topics: probability, information, entropy, information theory, noise, fundamental coding theorem,...

4
4.0

Jun 30, 2018
06/18

by
A. Mani

texts

#
eye 4

#
favorite 0

#
comment 0

In one perspective, the central problem pursued in this research is that of the inverse problem in the context of general rough sets. The problem is about the existence of rough basis for given approximations in a context. Granular operator spaces were recently introduced by the present author as an optimal framework for anti-chain based algebraic semantics of general rough sets and the inverse problem. In the framework, various subtypes of crisp and non crisp objects are identifiable that may...

Topics: Logic, Computing Research Repository, Information Theory, Logic in Computer Science, Artificial...

Source: http://arxiv.org/abs/1703.10251

16
16

Jun 30, 2018
06/18

by
A. Mani

texts

#
eye 16

#
favorite 0

#
comment 0

The study of mereology (parts and wholes) in the context of formal approaches to vagueness can be approached in a number of ways. In the context of rough sets, mereological concepts with a set-theoretic or valuation based ontology acquire complex and diverse behavior. In this research a general rough set framework called granular operator spaces is extended and the nature of parthood in it is explored from a minimally intrusive point of view. This is used to develop counting strategies that...

Topics: Mathematics, Computing Research Repository, Information Theory, Logic in Computer Science,...

Source: http://arxiv.org/abs/1701.08301

4
4.0

Jun 30, 2018
06/18

by
A. Mani

texts

#
eye 4

#
favorite 0

#
comment 0

Not all approximations arise from information systems. The problem of fitting approximations, subjected to some rules (and related data), to information systems in a rough scheme of things is known as the \emph{inverse problem}. The inverse problem is more general than the duality (or abstract representation) problems and was introduced by the present author in her earlier papers. From the practical perspective, a few (as opposed to one) theoretical frameworks may be suitable for formulating...

Topics: Discrete Mathematics, Logic, Computing Research Repository, Information Theory, Artificial...

Source: http://arxiv.org/abs/1704.05443

7
7.0

Jun 29, 2018
06/18

by
A. Mani

texts

#
eye 7

#
favorite 0

#
comment 0

The inverse problem of general rough sets, considered by the present author in some of her earlier papers, in one of its manifestations is essentially the question of when an agent's view about crisp and non crisp objects over a set of objects has a rough evolution. In this research the nature of the problem is examined from number-theoretic and combinatorial perspectives under very few assumptions about the nature of data and some necessary conditions are proved.

Topics: Artificial Intelligence, Mathematics, Information Theory, Logic, Combinatorics, Computing Research...

Source: http://arxiv.org/abs/1605.01778

11
11

Jun 27, 2018
06/18

by
A. Melakheso; K. Guenda

texts

#
eye 11

#
favorite 0

#
comment 0

In this paper, we study the linear codes over the commutative ring $R=\F_{q}+v\F_{q}+v^{2}\F_{q}$ and their Gray images, where $v^{3}=v$. We define the Lee weight of the elements of $R$, we give a Gray map from $R^{n}$ to $\F^{3n}_{q}$ and we give the relation between the dual and the Gray image of a code. This allows us to investigate the structure and properties of self-dual cyclic, formally self-dual and the Gray image of formally self-dual codes over $R$. Further, we give several...

Topics: Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1504.08097

8
8.0

Jun 30, 2018
06/18

by
A. Melakhessou; K. Guenda; T. A. Gulliver; M. Shi; P. Solé

texts

#
eye 8

#
favorite 0

#
comment 0

In this paper we investigate linear codes with complementary dual (LCD) codes and formally self-dual codes over the ring $R=\F_{q}+v\F_{q}+v^{2}\F_{q}$, where $v^{3}=v$, for $q$ odd. We give conditions on the existence of LCD codes and present construction of formally self-dual codes over $R$. Further, we give bounds on the minimum distance of LCD codes over $\F_q$ and extend these to codes over $R$.

Topics: Rings and Algebras, Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1704.03519

12
12

Jun 27, 2018
06/18

by
A. Moharrer; S. Wei; G. T. Amariucai; J. Deng

texts

#
eye 12

#
favorite 0

#
comment 0

In this work, our objective is to find out how topological and algebraic properties of unrooted Gaussian tree models determine their security robustness, which is measured by our proposed max-min information (MaMI) metric. Such metric quantifies the amount of common randomness extractable through public discussion between two legitimate nodes under an eavesdropper attack. We show some general topological properties that the desired max-min solutions shall satisfy. Under such properties, we...

Topics: Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1504.02530

5
5.0

Jun 30, 2018
06/18

by
A. Orlitsky; N. Santhanam

texts

#
eye 5

#
favorite 0

#
comment 0

For a collection of distributions over a countable support set, the worst case universal compression formulation by Shtarkov attempts to assign a universal distribution over the support set. The formulation aims to ensure that the universal distribution does not underestimate the probability of any element in the support set relative to distributions in the collection. When the alphabet is uncountable and we have a collection $\cal P$ of Lebesgue continuous measures instead, we ask if there is...

Topics: Mathematics, Computing Research Repository, Information Theory

Source: http://arxiv.org/abs/1410.4550

5
5.0

Jun 30, 2018
06/18

by
A. P. Konijnenberg; W. M. J. Coene; H. P. Urbach

texts

#
eye 5

#
favorite 0

#
comment 0

Recently, efforts have been made to improve ptychography phase retrieval algorithms so that they are more robust against noise. Often the algorithm is adapted by changing the cost functional that needs to be minimized. In particular, it has been suggested that the cost functional should be obtained using a maximum-likelihood approach that takes the noise statistics into account. Here, we consider the different choices of cost functional, and to how they affect the reconstruction results. We...

Topics: Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1703.10892

18
18

Jun 28, 2018
06/18

by
A. Pourmoghadas; P. G. Poonacha

texts

#
eye 18

#
favorite 0

#
comment 0

Machine type communications (MTC) in 3G/4G networks is getting more attention recently due to bursty nature of traffic characteristics in contrast to Poisson type H2H traffic. A large number of methods have been suggested in the literature. In this paper we give a mathematical model on performance analysis of Disjoint Allocation (DA) and Joint Allocation (JA) methods for allocating preambles to M2M and H2H users. In an earlier work we had investigated the performance of two possible splitting...

Topics: Information Theory, Networking and Internet Architecture, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1508.07742

3
3.0

Jun 30, 2018
06/18

by
A. Seda; S. Vedat

texts

#
eye 3

#
favorite 0

#
comment 0

Codes over various metrics such as Rosenbloom-Tsfasman (RT), Lee, etc. have been considered. Recently, codes over poset metrics have been studied. Poset metric is a great generalization of many metrics especially the well-known ones such as the RT and the Hamming metrics. Poset metric can be realized on the channels with localized error occurrences. It has been shown that MacWilliams identities are not admissible for codes over poset metrics in general [Kim and Oh, 2005]. Lately, to overcome...

Topics: Mathematics, Computing Research Repository, Information Theory

Source: http://arxiv.org/abs/1408.1560

4
4.0

Jun 28, 2018
06/18

by
A. Seel; A. Davtyan; U. Pietsch; O. Loffeld

texts

#
eye 4

#
favorite 0

#
comment 0

We apply the $l_1$ minimizing technique of compressive sensing (CS) to non-linear quadratic observations. For the example of coherent X-ray scattering we provide the formulae for a Kalman filter approach to quadratic CS and show how to reconstruct the scattering data from their spatial intensity distribution.

Topics: Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1511.02633

3
3.0

Jun 30, 2018
06/18

by
A. Tasdighi; M. R. Sadeghi

texts

#
eye 3

#
favorite 0

#
comment 0

A simple and general definition of quasi cyclic low density parity check (QC LDPC) codes which are constructed based on circulant permutation matrices (CPM) is proposed. As an special case of this definition, we first represent one type of so called combinatorially designed multiple edge protograph codes. The code construction is mainly based on perfect difference families (PDF) and is called Construction 1. Secondly, using the proposed Construction 1 along with a technique named as column...

Topics: Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1701.06218

13
13

Jun 29, 2018
06/18

by
A. V. Gurzadyan; A. E. Allahverdyan

texts

#
eye 13

#
favorite 0

#
comment 0

We study the hypothesis of information panspermia assigned recently among possible solutions of the Fermi paradox ("where are the aliens?"). It suggests that the expenses of alien signaling can be significantly reduced, if their messages contain compressed information. To this end we consider universal compression and decoding mechanisms (e.g. the Lempel-Ziv-Welch algorithm) that can reveal non-random structures in compressed bit strings. The efficiency of Kolmogorov stochasticity...

Topics: Data Analysis, Statistics and Probability, Instrumentation and Methods for Astrophysics, Physics,...

Source: http://arxiv.org/abs/1603.00048

Folkscanomy Miscellaneous

610
610

Dec 30, 2015
12/15

by
AAECC-13 (1999 : Honolulu, Hawaii); Fossorier, Marc, 1964-

texts

#
eye 610

#
favorite 0

#
comment 0

Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 13th International Symposium, AAECC-13 Honolulu, Hawaii, USA, November 15–19, 1999 Proceedings Author: Marc Fossorier, Hideki Imai, Shu Lin, Alain Poli Published by Springer Berlin Heidelberg ISBN: 978-3-540-66723-0 DOI: 10.1007/3-540-46796-3 Table of Contents: Codes on Graphs: A Survey for Algebraists RA Codes Achieve AWGN Channel Capacity Monomial Ideals and Planar Graphs A Fast Program Generator of Fast Fourier Transforms On...

Topics: Error-correcting codes (Information theory), Algebra, Algorithms

Folkscanomy Miscellaneous

425
425

Dec 30, 2015
12/15

by
AAECC-14 (2001 : Melbourne, Vic.); Boztaş, Serdar; Shparlinski, Igor E

texts

#
eye 425

#
favorite 0

#
comment 0

Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 14th International Symposium, AAECC-14 Melbourne, Australia, November 26–30, 2001 Proceedings Author: Serdar Boztaş, Igor E. Shparlinski Published by Springer Berlin Heidelberg ISBN: 978-3-540-42911-1 DOI: 10.1007/3-540-45624-4 Table of Contents: The Ubiquity of Reed-Muller Codes Self-dual Codes-Theme and Variations Design of Differential Space-Time Codes Using Group Theory Ideal Error-Correcting Codes: Unifying Algebraic and...

Topics: Error-correcting codes (Information theory), Algebra, Algorithms

3
3.0

Dec 26, 2021
12/21

by
AAECC-4 (1986 : Karlsruhe, Germany)

texts

#
eye 3

#
favorite 0

#
comment 0

214 pages

Topics: Error-correcting codes (Information theory) -- Congresses, Algebra -- Data processing --...

2
2.0

Jul 20, 2022
07/22

by
AAECC-4 (1986 : Karlsruhe, Germany)

texts

#
eye 2

#
favorite 0

#
comment 0

214 pages

Topics: Error-correcting codes (Information theory) -- Congresses, Algebra -- Data processing --...

4
4.0

Aug 6, 2020
08/20

by
AAECC-5 (1987 : Menorca, Spain)

texts

#
eye 4

#
favorite 0

#
comment 0

417 p. : 25 cm

Topics: Error-correcting codes (Information theory) -- Congresses, Algebra -- Data processing --...

3
3.0

Jul 20, 2022
07/22

by
AAECC-8 (1990 : Tokyo, Japan)

texts

#
eye 3

#
favorite 0

#
comment 0

ix, 390 p. : 25 cm

Topics: Error-correcting codes (Information theory) -- Congresses, Algebra -- Data processing --...

5
5.0

Jun 29, 2018
06/18

by
Aaditya Ramdas; David Isenberg; Aarti Singh; Larry Wasserman

texts

#
eye 5

#
favorite 0

#
comment 0

Linear independence testing is a fundamental information-theoretic and statistical problem that can be posed as follows: given $n$ points $\{(X_i,Y_i)\}^n_{i=1}$ from a $p+q$ dimensional multivariate distribution where $X_i \in \mathbb{R}^p$ and $Y_i \in\mathbb{R}^q$, determine whether $a^T X$ and $b^T Y$ are uncorrelated for every $a \in \mathbb{R}^p, b\in \mathbb{R}^q$ or not. We give minimax lower bound for this problem (when $p+q,n \to \infty$, $(p+q)/n \leq \kappa < \infty$, without...

Topics: Machine Learning, Mathematics, Information Theory, Statistics Theory, Learning, Statistics,...

Source: http://arxiv.org/abs/1601.06259