Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userMaximum $w$-cyclic holely group divisible packings with block size three and applications to optical orthogonal codes
131
0
0.0
(
0
)
Added by
Junling Zhou
Publication date
2020
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
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 $uequiv0,1~(bmod~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 $(utimes vtimes w,3,1)$ optical orthogonal code with at most one optical pulse per spatial plane and per wavelength plane.
rate research
Read More
How can $d+k$ vectors in $mathbb{R}^d$ be arranged so that they are as close to orthogonal as possible? In particular, define $theta(d,k):=min_Xmax_{x eq yin X}|langle x,yrangle|$ where the minimum is taken over all collections of $d+k$ unit vectors $Xsubseteqmathbb{R}^d$. In this paper, we focus on the case where $k$ is fixed and $dtoinfty$. In establishing bounds on $theta(d,k)$, we find an intimate connection to the existence of systems of ${k+1choose 2}$ equiangular lines in $mathbb{R}^k$. Using this connection, we are able to pin down $theta(d,k)$ whenever $kin{1,2,3,7,23}$ and establish asymptotics for general $k$. The main tool is an upper bound on $mathbb{E}_{x,ysimmu}|langle x,yrangle|$ whenever $mu$ is an isotropic probability mass on $mathbb{R}^k$, which may be of independent interest. Our results translate naturally to the analogous question in $mathbb{C}^d$. In this case, the question relates to the existence of systems of $k^2$ equiangular lines in $mathbb{C}^k$, also known as SIC-POVM in physics literature.
Optical orthogonal signature pattern codes (OOSPCs) have attracted wide attention as signature patterns of spatial optical code division multiple access networks. In this paper, an improved upper bound on the size of an $(m,n,3,lambda_a,1)$-OOSPC with $lambda_a=2,3$ is established. The exact number of codewords of an optimal $(m,n,3,lambda_a,1)$-OOSPC is determined for any positive integers $m,nequiv2 ({rm mod } 4)$ and $lambda_ain{2,3}$.
For which positive integers $n,k,r$ does there exist a linear $[n,k]$ code $C$ over $mathbb{F}_q$ with all codeword weights divisible by $q^r$ and such that the columns of a generating matrix of $C$ are projectively distinct? The motivation for studying this problem comes from the theory of partial spreads, or subspace codes with the highest possible minimum distance, since the set of holes of a partial spread of $r$-flats in $operatorname{PG}(v-1,mathbb{F}_q)$ corresponds to a $q^r$-divisible code with $kleq v$. In this paper we provide an introduction to this problem and report on new results for $q=2$.
This article discusses the decoding of Gabidulin codes and shows how to extend the usual decoder to any supercode of a Gabidulin code at the cost of a significant decrease of the decoding radius. Using this decoder, we provide polynomial time attacks on the rank-metric encryption schemes RAMESSES and LIGA.
We present new quantum codes with good parameters which are constructed from self-orthogonal algebraic geometry codes. Our method permits a wide class of curves to be used in the formation of these codes, which greatly extends the class of a previous paper due to Munuera, Tenorio and Torres. These results demonstrate that there is a lot more scope for constructing self-orthogonal AG codes than was previously known.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
