Related papers: $\mathbb{Z}_p\mathbb{Z}_{p^2}$-linear codes: rank …
A self-dual binary linear code is called Type I code if it has singly-even codewords, i.e.~it has codewords with weight divisible by $2.$ The purpose of this paper is to investigate interesting properties of Type I codes of different…
The rate of a network code is the ratio of the block size of the network's messages to that of its edge codewords. We compare the linear capacities and achievable rate regions of networks using finite field alphabets to the more general…
Cyclic codes over R have been introduced recently. In this paper, we study the cyclic codes over R and their $\Z_2$ image. Making use of algebraic structure, we find the some good $\Z_2$ codes of length 28.
Hadamard full propelinear codes (HFP-codes) are introduced and their equivalence with Hadamard groups is proven (on the other hand, it is already known the equivalence of Hadamard groups with relative $(4n,2,4n,2n)$-difference sets in a…
Sum-rank metric codes are a natural extension of both linear block codes and rank-metric codes. They have several applications in information theory, including multishot network coding and distributed storage systems. The aim of this…
Let $p$ be a prime number and let $K$ be a genus one two-bridge knot. In the spirit of arithmetic topology, we observe that if $p$ divides the size of the 1st homology group of some odd-th cyclic branched cover of the knot $K$, then its…
Linear-programming pseudocodewords play a pivotal role in our understanding of the linear-programming decoding algorithms. These pseudocodewords are known to be equivalent to the graph-cover pseudocodewords. The latter pseudocodewords, when…
Let $G$ be a $p$-group and let $\chi$ be an irreducible character of $G$. The codegree of $\chi$ is given by $|G:\text{ker}(\chi)|/\chi(1)$. This paper investigates the relationship between the nilpotence class of a group and the inclusion…
This is a chapter of the upcoming "A Concise Encyclopedia of Coding Theory", W.C. Huffman, J.-L. Kim, and P. Sole' Eds., CRC Press. The chapter gives an introduction to the mathematical theory of rank-metric codes. Treated topics include:…
Two-weight linear codes are linear codes in which any nonzero codeword can have only two possible distinct weights. Those in the Hamming metric have proven to be very interesting for their connections with authentication codes, association…
In this paper we investigate connections between linear sets and subspaces of linear maps. We give a geometric interpretation of the results of [18, Section 5] on linear sets on a projective line. We extend this to linear sets in arbitrary…
Let $E$ be an elliptic curve with good reduction at a fixed odd prime $p$ and $K$ an imaginary quadratic field where $p$ splits. We give a growth estimate for the Mordell-Weil rank of $E$ over finite extensions inside the…
Linear codes have been an interesting topic in both theory and practice for many years. In this paper, for an odd prime $p$, we determine the explicit complete weight enumerators of two classes of linear codes over $\mathbb{F}_p$ and they…
Zero forcing number has recently become an interesting graph parameter studied in its own right since its introduction by the "AIM Minimum Rank -- Special Graphs Work Group", whereas metric dimension is a well-known graph parameter. We…
Rank-metric codes, defined as sets of matrices over a finite field with the rank distance, have gained significant attention due to their applications in network coding and connections to diverse mathematical areas. Initially studied by…
Let $n$ and $p$ be non-negative integers with $n \geq p$, and $S$ be a linear subspace of the space of all $n$ by $p$ matrices with entries in a field $\mathbb{K}$. A classical theorem of Flanders states that $S$ contains a matrix with rank…
We examine the phenomenon of capitulation of the $p$-class group $H_K$ of a real number field $K$ in totally ramified cyclic p-extensions $L/K$ of degree $p^N$. Using an elementary property of the algebraic norm $\nu_{L/K}$, we show that…
We say that a linear code C over a field F is triangular representable if there exists a two dimensional simplicial complex $\Delta$ such that C is a punctured code of the kernel ker $\Delta$ of the incidence matrix of $\Delta$ over F and…
Linear codes have been an interesting topic in both theory and practice for many years. In this paper, for a prime $p$, we determine the explicit complete weight enumerators of a family of linear codes over $\mathbb{F}_p$ with defining set…
We investigate the $a$-numbers of $\mathbb{Z}/p^2\mathbb{Z}$-covers in characteristic $p>2$ and extend a technique originally introduced by Farnell and Pries for $\mathbb{Z}/p\mathbb{Z}$-covers. As an application of our approach, we…