Maximum w-cyclic holely group divisible packings with block size three and applications to optical orthogonal codes

06/12/2020
by   Zenghui Fang, et al.
0

In this paper we investigate combinatorial constructions for w-cyclic holely group divisible packings with block size three (briefly by 3-HGDPs). For any positive integers u,v,w with u≡0,1 ( 3), the exact number of base blocks of a maximum w-cyclic 3-HGDP of type (u,w^v) is determined. This result is used to determine the exact number of codewords in a maximum three-dimensional (u× v× w,3,1) optical orthogonal code with at most one optical pulse per spatial plane and per wavelength plane.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/28/2022

On abelian and cyclic group codes

We determine a condition on the minimum Hamming weight of some special a...
research
10/05/2019

On self-duality and hulls of cyclic codes over F_2^m[u]/〈 u^k〉 with oddly even length

Let F_2^m be a finite field of 2^m elements, and R=F_2^m[u]/〈 u^k〉=F_2^m...
research
01/02/2023

Polynomial representation of additive cyclic codes and new quantum codes

We give a polynomial representation for additive cyclic codes over 𝔽_p^2...
research
02/01/2021

Cyclic Orbit Flag Codes

In network coding, a flag code is a set of sequences of nested subspaces...
research
01/05/2023

Improved Gilbert-Varshamov bounds for hopping cyclic codes and optical orthogonal codes

Hopping cyclic codes (HCCs) are (non-linear) cyclic codes with the addit...
research
05/25/2018

McEliece-type Cryptosystems over Quasi-cyclic Codes

In this thesis, we study algebraic coding theory based McEliece-type cry...
research
11/10/2021

Rectangular, Range, and Restricted AONTs: Three Generalizations of All-or-Nothing Transforms

All-or-nothing transforms (AONTs) were originally defined by Rivest as b...

Please sign up or login with your details

Forgot password? Click here to reset