AI Chat AI Image Generator AI Video Text to Speech

No projective 16-divisible binary linear code of length 131 exists

06/18/2020
∙
by   Sascha Kurz, et al.
∙
0
∙

We show that no projective 16-divisible binary linear code of length 131 exists. This implies several improved upper bounds for constant-dimension codes, used in random linear network coding, and partial spreads.

READ FULL TEXT

page 1

page 2

page 3

page 4

Related Research

research
∙ 10/21/2020

On the maximum number of minimal codewords

Minimal codewords have applications in decoding linear codes and in cryp...
0 Romar dela Cruz, et al. ∙
research
∙ 05/21/2022

A graphical representation of binary linear codes

A binary [n,k]-linear code 𝒞 is a k-dimensional subspace of 𝔽_2^n. For x...
0 Lisbeth Danyeli Delgado Ordoñez, et al. ∙
research
∙ 01/19/2009

An Upper Limit of AC Huffman Code Length in JPEG Compression

A strategy for computing upper code-length limits of AC Huffman codes fo...
0 Kenichi Horie, et al. ∙
research
∙ 01/03/2020

Upper bounds for stabbing simplices by a line

It is known that for every dimension d> 2 and every k<d there exists a c...
0 Inbar Daum-Sadon, et al. ∙
research
∙ 04/29/2021

How (Non-)Optimal is the Lexicon?

The mapping of lexical meanings to wordforms is a major feature of natur...
0 Tiago Pimentel, et al. ∙
research
∙ 03/19/2022

Bounds on Unique-Neighbor Codes

Let A be an m× n parity check matrix of a binary code of length n, rate ...
0 Nati Linial, et al. ∙
research
∙ 05/09/2022

Linear Runlength-Limited Subcodes of Reed-Muller Codes and Coding Schemes for Input-Constrained BMS Channels

In this work, we address the question of the largest rate of linear subc...
0 V. Arvind Rameshwar, et al. ∙

Please sign up or login with your details

Forgot password? Click here to reset

Out of credits

Refill your membership to continue using DeepAI

Stripe
Paypal