Uniquely optimal codes of low complexity are symmetric

08/28/2020
by   Christopher Cox, et al.
0

We formulate explicit predictions concerning the symmetry of optimal codes in compact metric spaces. This motivates the study of optimal codes in various spaces where these predictions can be tested.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/01/2018

Optimal LRC codes for all lenghts n <= q

A family of distance-optimal LRC codes from certain subcodes of q-ary Re...
research
11/09/2020

On the classification of quaternary optimal Hermitian LCD codes

We propose a method for a classification of quaternary Hermitian LCD cod...
research
03/07/2021

LCD Codes from tridiagonal Toeplitz matrice

Double Toeplitz (DT) codes are codes with a generator matrix of the form...
research
12/13/2021

Bounds in the Lee Metric and Optimal Codes

In this paper we investigate known Singleton-like bounds in the Lee metr...
research
12/05/2017

State spaces of convolutional codes, codings and encoders

In this paper we give a compact presentation of the theory of abstract s...
research
05/10/2022

Multichannel Optimal Tree-Decodable Codes are Not Always Optimal Prefix Codes

The theory of multichannel prefix codes aims to generalize the classical...
research
09/23/2018

Quantitatively Admissible Representations and the "Main Theorem" of Type-2 COMPLEXITY Theory

Choosing an encoding over binary strings is usually straightforward or i...

Please sign up or login with your details

Forgot password? Click here to reset