Lengths of divisible codes with restricted column multiplicities

03/30/2023
by   Theresa Körner, et al.
0

We determine the minimum possible column multiplicity of even, doubly-, and triply-even codes given their length. This refines a classification result for the possible lengths of q^r-divisible codes over 𝔽_q. We also give a few computational results for field sizes q>2. Non-existence results of divisible codes with restricted column multiplicities for a given length have applications e.g. in Galois geometry and can be used for upper bounds on the maximum cardinality of subspace codes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/01/2022

Generalized Singleton Type Upper Bounds

In this paper we give upper bounds on the sizes of (d, L) list-decodable...
research
01/18/2022

The maximum cardinality of trifferent codes with lengths 5 and 6

A code 𝒞⊆{0, 1, 2}^n is said to be trifferent with length n when for any...
research
03/13/2023

Bounds and Algorithms for Frameproof Codes and Related Combinatorial Structures

In this paper, we study upper bounds on the minimum length of frameproof...
research
07/24/2023

In search of maximum non-overlapping codes

Non-overlapping codes are block codes that have arisen in diverse contex...
research
08/28/2019

The Rise and Fall of the Note: Changing Paper Lengths in ACM CSCW, 2000-2018

In this note, I quantitatively examine various trends in the lengths of ...
research
08/30/2022

Achievable Rates and Algorithms for Group Testing with Runlength Constraints

In this paper, we study bounds on the minimum length of (k,n,d)-superimp...
research
10/22/1998

Computational Geometry Column 32

The proof of Dey's new k-set bound is illustrated....

Please sign up or login with your details

Forgot password? Click here to reset