Skip to main content

Questions tagged [coding-theory]

The mathematical theory of codes, as used in communication, data compression, and cryptography.

Filter by
Sorted by
Tagged with
1 vote
0 answers
54 views

Underlying codes in Niederreiter cryptosystems

Niederreiter cryptosystem is usually described by a parity check matrix $H$ over $\mathbb{F}_{2^n}$. The minimum distance $d$ is given by $d= min\lbrace k \text{ such that there are $k$ linearly ...
Root's user avatar
  • 387
1 vote
0 answers
185 views

The edit distance of BWT of two strings with one difference

Let $BWT$ stand for the Burrows-Wheeler transform on strings. What is the maximal edit distance of $BWT(w)$ and $BWT(u)$, if $w$ and $u$ differ only in one character.
J.Doe's user avatar
  • 19
1 vote
0 answers
88 views

Convex hull of codebook (LP-decoding)

So the well-cited article by Feldman et al from 2005 has a method of constructing the convex hull of the feasible set for ML-decoding. Basically, he considers the parity check matrix $H$ as a Tanner ...
luegofuego's user avatar
1 vote
0 answers
43 views

Reference request on dynamic flows combined with network coding

I have read some papers about network coding and dynamic flows (flows over time). I think I have made comprehensive searches on google, google scholar and IEEE Xplore. IMHO, the reasons for the ...
robit's user avatar
  • 111
1 vote
0 answers
69 views

Optimal distribution of integer edge weights

I am not sure whether the following problem has been studied. Any help would be greatly appreciated. I have $L$ sets, $S_1, S_2,...,S_L$, each of $n$ elements, taken from a universe of $N$ elements. ...
MJK's user avatar
  • 315
1 vote
0 answers
68 views

The curve used in Parvaresh-Vardy decoding

Consider the Parvaresh-Vardy list decoder. As I understand it, the idea is to decide on a curve over an extension field of the form $(f,f^h mod E, f^{h^2} mod E,\dots)$ and then evaluate each of ...
BharatRam's user avatar
  • 393
1 vote
0 answers
45 views

Decoding of Gabidulin codes

Consider the space of matrices in $\mathbb{F}_q^{n \times m}$ where $\mathbb{F}_q$ is the finite field with $q$ elements. We can define a metric on this space, given by $d(A,B) := rank(A-B)$, called ...
BharatRam's user avatar
  • 393
1 vote
0 answers
20 views

can constant weight codes achieve channel capacity

Can a sequence of constant weight linear codes achieve channel capacity on Additive White Gaussian Noise channel? (by a sequence achieving capacity I mean a sequence of linear codes of increasing ...
Turbo's user avatar
  • 13k
1 vote
0 answers
61 views

Number of non-isomorphic codes

We have number of non-isomorphic graphs given in http://planetmath.org/enumeratinggraphs Over an alphabet $q$ how many non-isomorphic $[n,k,d]_q$ codes are possible particularly in the special case ...
Turbo's user avatar
  • 13k
1 vote
0 answers
114 views

On Labeling the cube

Regularly in a Hamming hypercube, the vertices are labelled so that edge difference equals path difference. That is greater the edge difference, greater the hamming distance of the labelled vertices ...
Turbo's user avatar
  • 13k
1 vote
0 answers
138 views

Information theory and Tsfasman-Manin's problem

Yuri Manin recently posted an interesting paper on computability of boundary regions of distance-rate trade-offs for error correction codes. http://arxiv.org/PS_cache/arxiv/pdf/1107/1107.4246v1.pdf I ...
v s's user avatar
  • 2,208
1 vote
0 answers
338 views

Soft decoding of linear block (20,10) codes - what methods are used ?

What algorithms are advised for soft-decoding of linear block codes (20,10) ? What are advised references ? Sincerely Yours Alex PS By soft-decoding - I mean that input - is set of 20 real ...
Alexander Chervov's user avatar
1 vote
1 answer
104 views

Code indistinguishability assumption for Code based cryptography (in special cases)

Cryptosystems that are based on error correcting codes are often based with hardness of the two problem. Computational syndrome decoding is hard Indistinguishability Assumption (IA): Distinguishing ...
Root's user avatar
  • 387
0 votes
2 answers
224 views

Bounds for maximum number of code-words in a ternary error correcting code with length n and distance d?

I'm not sure I can find an explicit formula. Wondering if anyone can come up with lower/upper bounds.
Mkch's user avatar
  • 113
0 votes
1 answer
373 views

Source Coding Theorem: what happen when we go below N*H(x) bits?

I was following the textbook by David Mackay: Information theory inference and learning algorithms. I have question on Shannon's source coding theorem (p81): $N$ i.i.d. random variables each with ...
kuku's user avatar
  • 123
0 votes
2 answers
141 views

Determining the distribution of results of a simple algorithm

Setting Consider repeating the following process on the numbers $N=\{1, 2, 3, \ldots, n\}$: Pick an integer $k \in N$, uniformly at random. Pick a subset of $k$ elements from $N$, uniformly at random....
Ari Trachtenberg's user avatar
0 votes
1 answer
119 views

Notation of sequences in rate distortion theory

I have been reading whatever sources I could get my hands on today, regarding this problem. Most notes online about rate distortion theory come from the book Elements of Information Theory by Thomas ...
sn3jd3r's user avatar
  • 133
0 votes
1 answer
55 views

weights in low density codes

Generally, low density parity codes are decoded using sum product decoder (also known as decoding under belief propagation). Such codes are usually decoded nicely if there are no short length cycles ...
Root's user avatar
  • 387
0 votes
0 answers
87 views

Existence of a family of size 2^Ω(n) of subsets of {1,...,n} each of cardinality n/4 where two subsets have at most n/8 elements in common

Let $\mathcal{G}$ be a family of $t=2^{\Omega(n)}$ subsets of $N=\{1,2,...,n\}$, each of cardinality $n / 4$ so that any two distinct members of $\mathcal{G}$ have at most $n / 8$ elements in common. ...
C. Mürtz's user avatar
  • 101
0 votes
0 answers
60 views

Is there a name/terminology for binary codes with evenly spaced number of ones?

I am generating a random binary matrix $A \in \{0, 1\}^{m \times n}$ with the number of ones in each row set to evenly spaced numbers from an interval. For example, if $n=50$, the number of ones for $...
randomprime's user avatar
0 votes
0 answers
162 views

Is the following graph an expander graph?

Let's say we have the following bipartite-graph, denoted $G=(L,R,E)$: It has the following adjacency matrix: I am having problems decoding a received word from what I was told is an expander code ...
Louie_the_unsolver's user avatar
0 votes
0 answers
33 views

Minimum distance of a code [duplicate]

Is there a way to compute minimum distance of a code given a systematic parity check matrix? I know that min dist is smallest number $d$ such that there exists $d$ linearly dependant columns. I am ...
Root's user avatar
  • 387
0 votes
0 answers
54 views

Number of different cycles in cyclic codes with length n

I am studying Information theory, coding theory in particular at the moment, and I am having trouble determining how many different cycles are defined by a certain generator polinomial? Given a ...
Mark's user avatar
  • 101
-1 votes
0 answers
25 views

Shannon's Code Ordering of Probabilities

The first step in the Shannon's Code is to order the probabilities in decreasing order. Why do we do this? Is it to make it prefix-free or assign most probable words with shorter codewords?
revision's user avatar
-1 votes
1 answer
120 views

Does a code need at least two symbols to be defined as a code? [closed]

I am wondering whether you could still call a code something that, if transmitting, only transmits one symbol. Or does the formal definition of code require 2 or more symbols? (and would the answer ...
magnolia1's user avatar
-3 votes
1 answer
68 views

Complicated Huffman coding [closed]

I am trying to figure out how to code these symbols. I am pretty sure I have it, but it gets a little tricky. Let A,B, and C have probabilities .71, .16, and .13 respectively. I am trying to code the ...
Jack Armstrong's user avatar
-4 votes
2 answers
478 views

Covering Codes with Game Theory Application

Here is a question I came up with and i have been pondering for a while. It relates to covering codes, a subset of coding theory. I could not come up with an adequate solution, so here I am, asking ...
Alka's user avatar
  • 13

1 2
3