The asymptotic rate vs. distance problem is a long-standing fundamental
...
The rate vs. distance problem is a long-standing open problem in coding
...
We develop a new family of linear programs, that yield upper bounds on t...
Let A be an m× n parity check matrix of a binary code of length n,
rate ...
Hypertrees are high-dimensional counterparts of graph theoretic trees. T...
We think of a tournament T=([n], E) as a communication network where in
...
We investigate the weight distribution of random binary linear codes. Fo...