SearcharxivSearch

arXiv subjects

Martianus Frederic Ezerman

Publications and source records attributed to Martianus Frederic Ezerman.

At least 19 recordsLinked to original sources

Generalized Extended Codes with Applications in Entanglement-Assisted Qubit and Qutrit Codes

We prove that any generalized extended code is monomially equivalent to the Hermitian dual of a code which is closely related to a second kind of extended code of $\C^{\perp_{\rm H}}$. Every $[n+1,k+1]_{q^2}$ linear code $\D$ with $d(\D^{\perp_{\rm H}})>1$ is monomially equivalent to the generalized extended code $\C({\bf u},a)$ of an $[n,k]_{q^2}$ linear code $\C$ for a fixed $a\in\F_{q^2}^{*}$ and some ${\bf u}\in\F_{q^2}^{n}$. We then characterize the Hermitian hull and Hermitian dual distance of $\C({\bf u},a)$ in terms of the position of ${\bf u}$ relative to $\C+\C^{\perp_{\rm H}}$ and the interaction between ${\bf u}$ and the minimum weight codewords of $\C^{\perp_{\rm H}}$, respectively. We obtain explicit criteria to independently control the expected Hermitian hull dimension and Hermitian dual distance of $\C({\bf u},a)$. In particular, several conditions for simultaneously increasing the Hermitian hull dimension and the Hermitian dual distance of $\C({\bf u},a)$ are derived. Applying these results to the Hermitian construction for EAQECCs gives us $267$ new EA qubit codes of lengths $n \leq 40$ and $14$ new EA qutrit codes of lengths $n \leq 25$ compared to the best-known codes in Grassl's code tables and the imporvements recorded in very recent works in the literature. Among the new parameter sets, we confirm improvements for $236$ qubit and $8$ qutrit codes.

cs.IT

Hermitian Hulls of Rational Algebraic Geometry Codes and Applications in Quantum Codes

Interest in the hulls of linear codes has been growing rapidly. More is known when the inner product is Euclidean than Hermitian. A shift to the latter is gaining traction. The focus is on a code whose Hermitian hull dimension and dual distance can be systematically determined. Such a code can serve as an ingredient in designing the parameters of entanglement-assisted quantum error-correcting codes (EAQECCs). We use tools from algebraic function fields of one variable to efficiently determine a good lower bound on the Hermitian hull dimensions of generalized rational algebraic geometry (AG) codes. We identify families of AG codes whose hull dimensions can be well estimated by a lower bound. Given such a code, the idea is to select a set of evaluation points for which the residues of the Weil differential associated with the Hermitian dual code has an easily verifiable property. The approach allows us to construct codes with designed Hermitian hull dimensions based on known results on Reed-Solomon codes and their generalization. Using the Hermitian method on these maximum distance separable (MDS) codes with designed hull dimensions yields two families of MDS EAQECCs. We confirm that the excellent parameters of the quantum codes from these families are new.

cs.IT

Properties and Decoding of Twisted GRS Codes and Their Extensions

Maximum distance separable (MDS) codes that are not equivalent to generalized Reed-Solomon (GRS) codes are called non-GRS MDS codes. Alongside near MDS (NMDS) codes, they are applicable in communication, cryptography, and storage systems. From theoretical perspective, it is particularly intriguing to investigate families of linear codes in which each element can be determined to be either a non-GRS MDS or an NMDS code. Two promising candidates for such families emerge from what is known as twisted GRS (TGRS) construction. These candidates are the $(+)$-TGRS codes and their extended versions, called $(+)$-extended TGRS (ETGRS) codes. Although many of their properties have been characterized, there are gaps to fill. Which among the codes are non-GRS MDS? Can we improve on their decoding by using their error-correcting pairs or deep holes? In this paper we solve these problems. The answer to the first problem leads us to two classes of non-GRS MDS Hermitian self-dual TGRS codes and a proof that there is no Galois self-dual ETGRS code. Addressing the second problem, we present an explicit decoding algorithm for ETGRS codes that outperforms existing decoding algorithms given some conditions. By considering the duals of TGRS codes which are MDS, we determine the covering radius and a class of deep holes of the recently constructed non-GRS MDS codes due to Han and Zhang.

cs.IT

On Codes over Eisenstein Integers

We propose constructions of codes over quotient rings of Eisenstein integers equipped with the Euclidean, square Euclidean, and hexagonal distances as a generalization of codes over Eisenstein integer fields. By set partitioning, we effectively divide the ring of Eisenstein integers into equal-sized subsets for distinct encoding. Unlike in Eisenstein integer fields of prime size, where partitioning is not feasible due to structural limitations, we partition the quotient rings into additive subgroups in such a way that the minimum square Euclidean and hexagonal distances of each subgroup are strictly larger than in the original set. This technique facilitates multilevel coding and enhances signal constellation efficiency.

cs.IT

Characterization of Nearly Self-Orthogonal Quasi-Twisted Codes and Related Quantum Codes

Quasi-twisted codes are used here as the classical ingredients in the so-called Construction X for quantum error-control codes. The construction utilizes nearly self-orthogonal codes to design quantum stabilizer codes. We expand the choices of the inner product to also cover the symplectic and trace-symplectic inner products, in addition to the original Hermitian one. A refined lower bound on the minimum distance of the resulting quantum codes is established and illustrated. We report numerous record breaking quantum codes from our randomized search for inclusion in the updated online database.

quant-ph

On Linear Codes Whose Hermitian Hulls are MD

Hermitian hulls of linear codes are interesting for theoretical and practical reasons alike. In terms of recent application, linear codes whose hulls meet certain conditions have been utilized as ingredients to construct entanglement-assisted quantum error correcting codes. This family of quantum codes is often seen as a generalization of quantum stabilizer codes. Theoretically, compared with the Euclidean setup, the Hermitian case is much harder to deal with. Hermitian hulls of MDS linear codes with low dimensions have been explored, mostly from generalized Reed-Solomon codes. Characterizing Hermitian hulls which themselves are MDS appears to be more involved and has not been extensively studied. This paper introduces some tools to study linear codes whose Hermitian hulls are MDS. Using the tools, we then propose explicit constructions of such codes. We consider Hermitian hulls of both Reed-Solomon and non Reed-Solomon types of linear MDS codes. We demonstrate that, given the same Hermitian hull dimensions, the codes from our constructions have dimensions which are larger than those in the literature.

cs.IT

Griesmer Bound and Constructions of Linear Codes in $b$-Symbol Metric

The $b$-symbol metric is a generalization of the Hamming metric. Linear codes, in the $b$-symbol metric, have been used in the read channel whose outputs consist of $b$ consecutive symbols. The Griesmer bound outperforms the Singleton bound for $\mathbb{F}_q$-linear codes in the Hamming metric, when $q$ is fixed and the length is large enough. This scenario is also applicable in the $b$-symbol metric. Shi, Zhu, and Helleseth recently made a conjecture on cyclic codes in the $b$-symbol metric. In this paper, we present the $b$-symbol Griesmer bound for linear codes by concatenating linear codes and simplex codes. Based on cyclic codes and extended cyclic codes, we propose two families of distance-optimal linear codes with respect to the $b$-symbol Griesmer bound.

cs.IT

Bounds and Constructions of Quantum Locally Recoverable Codes from Quantum CSS Codes

Classical locally recoverable codes (LRCs) have become indispensable in distributed storage systems. They provide efficient recovery in terms of localized errors. Quantum LRCs have very recently been introduced for their potential application in quantum data storage. In this paper, we use classical LRCs to investigate quantum LRCs. We prove that the parameters of quantum LRCs are bounded by their classical counterparts. We deduce the bounds on the parameters of quantum LRCs from the bounds on the parameters of the classical ones. We establish a characterization of optimal pure quantum LRCs based on classical codes with specific properties. Using well-crafted classical LRCs as ingredients in the construction of quantum CSS codes, we offer the first construction of several families of optimal pure quantum LRCs.

cs.IT

Improved Spectral Bound for Quasi-Cyclic Codes

Spectral bounds form a powerful tool to estimate the minimum distances of quasi-cyclic codes. They generalize the defining set bounds of cyclic codes to those of quasi-cyclic codes. Based on the eigenvalues of quasi-cyclic codes and the corresponding eigenspaces, we provide an improved spectral bound for quasi-cyclic codes. Numerical results verify that the improved bound outperforms the Jensen bound in almost all cases. Based on the improved bound, we propose a general construction of quasi-cyclic codes with excellent designed minimum distances. For the quasi-cyclic codes produced by this general construction, the improved spectral bound is always sharper than the Jensen bound.

cs.IT

A Construction of Asymptotically Optimal Cascaded CDC Schemes via Combinatorial Designs

A coded distributed computing (CDC) system aims to reduce the communication load in the MapReduce framework. Such a system has $K$ nodes, $N$ input files, and $Q$ Reduce functions. Each input file is mapped by $r$ nodes and each Reduce function is computed by $s$ nodes. The objective is to achieve the maximum multicast gain. There are known CDC schemes that achieve optimal communication load. In some prominent known schemes, however, $N$ and $Q$ grow too fast in terms of $K$, greatly reducing their gains in practical scenarios. To mitigate the situation, some asymptotically optimal cascaded CDC schemes with $r=s$ have been proposed by using symmetric designs. In this paper, we put forward new asymptotically optimal cascaded CDC schemes with $r=s$ by using $1$-designs. Compared with earlier schemes from symmetric designs, ours have much smaller computation loads while keeping the other relevant parameters the same. We also obtain new asymptotically optimal cascaded CDC schemes with more flexible parameters compared with previously best-performing schemes.

cs.IT

Sharper Asymptotically Optimal CDC Schemes via Combinatorial Designs

Coded distributed computing (CDC) was introduced to greatly reduce the communication load for MapReduce computing systems. Such a system has $K$ nodes, $N$ input files, and $Q$ Reduce functions. Each input file is mapped by $r$ nodes and each Reduce function is computed by $s$ nodes. The architecture must allow for coding techniques that achieve the maximum multicast gain. Some CDC schemes that achieve optimal communication load have been proposed before. The parameters $N$ and $Q$ in those schemes, however, grow too fast with respect to $K$ to be of great practical value. To improve the situation, researchers have come up with some asymptotically optimal cascaded CDC schemes with $s+r=K$ from symmetric designs. In this paper, we propose new asymptotically optimal cascaded CDC schemes. Akin to known schemes, ours have $r+s=K$ and make use of symmetric designs as construction tools. Unlike previous schemes, ours have much smaller communication loads, given the same set of parameters $K$, $r$, $N$, and $Q$. We also expand the construction tools to include almost difference sets. Using them, we have managed to construct a new asymptotically optimal cascaded CDC scheme.

cs.IT

How Much Entanglement Does a Quantum Code Need?

In the setting of entanglement-assisted quantum error-correcting codes (EAQECCs), the sender and the receiver have access to pre-shared entanglement. Such codes promise better information rates or improved error handling properties. Entanglement incurs costs and must be judiciously calibrated in designing quantum codes with good performance, relative to their deployment parameters. Revisiting known constructions, we devise tools from classical coding theory to better understand how the amount of entanglement can be varied. We present three new propagation rules and discuss how each of them affects the error handling. Tables listing the parameters of the best performing qubit and qutrit EAQECCs that we can explicitly construct are supplied for reference and comparison.

quant-ph

Entanglement-Assisted and Subsystem Quantum Codes: New Propagation Rules and Constructions

This paper proposes new propagation rules on quantum codes in the entanglement-assisted and in quantum subsystem scenarios. The rules lead to new families of such quantum codes whose parameters are demonstrably optimal. To obtain the results, we devise tools to puncture and shorten codes in ways that ensure their Hermitian hulls have certain desirable properties. More specifically, we give a general framework to construct $k$-dimensional generalized Reed-Solomon codes whose Hermitian hulls are $(k-1)$-dimensional maximum distance separable codes.

cs.IT

A New Approach to Determine the Minimal Polynomials of Binary Modified de Bruijn Sequences

A binary modified de Bruijn sequence is an infinite and periodic binary sequence derived by removing a zero from the longest run of zeros in a binary de Bruijn sequence. The minimal polynomial of the modified sequence is its unique least-degree characteristic polynomial. Leveraging on a recent characterization, we devise a novel general approach to determine the minimal polynomial. We translate the characterization into a problem of identifying a Hamiltonian cycle in a specially constructed graph. Along the way, we demonstrate the usefullness of computational tools from the cycle joining method in the modified setup.

cs.IT

Three New Infinite Families of Optimal Locally Repairable Codes from Matrix-Product Codes

Locally repairable codes have become a key instrument in large-scale distributed storage systems. This paper focuses on the construction of locally repairable codes with $(r,δ)$-locality that achieve the equality in the Singleton-type bound. We use matrix-product codes to propose two infinite families of $q$-ary optimal $(r,δ)$ locally repairable codes of lengths up to $q^2+q$. The ingredients in the matrix-product codes are either linear maximum distance separable codes or optimal locally repairable codes of small lengths. Further analysis and refinement yield a construction of another infinite family of optimal $(r,δ)$ locally repairable codes. The codes in this third family have unbounded lengths not divisible by $(r+δ-1)$. The three families of optimal $(r,δ)$ locally repairable codes constructed here are new. Previously constructed codes in the literature have not covered the same sets of parameters. Our construction proposals are flexible since one can easily vary $r$ and $δ$ to come up with particular parameters that can suit numerous scenarios.

cs.IT

New Interleaving Constructions of Asymptotically Optimal Periodic Quasi-Complementary Sequence Sets

The correlation properties of sequences form a focal point in the design of multiple access systems of communications. Such a system must be able to serve a number of simultaneous users while keeping interference low. A popular choice for the set of sequences to deploy is the quasi-complementary sequence set (QCSS). Its large set size enables the system to accommodate a lot of users. The set has low nontrivial correlation magnitudes within a zone around the origin. This keeps undue interference among users under control. A QCSS performs better than the perfect complementary sequence set (PCSS) does in schemes with fractional delays. The optimality of a set of periodic sequences is measured by its maximum periodic correlation magnitude, for which there is an established lower bound to aim at. For a fixed period, optimal sets are known only for very restricted parameters. Efforts have therefore been centered around the constructions of asymptotically optimal sets. Their periods are allowed to be as large as sufficient to establish optimality. In this paper we share an insight that a sequence set that asymptotically attains the Welch bound generates an asymptotically optimal periodic QCSS by interleaving. One can simply use known families of such sequence sets to construct the desired QCSSs. Seven families of QCSSs with specific parameters are shown as examples of this general construction. We build upon the insight to propose two new direct constructions of asymptotically optimal QCSSs with very flexible parameters without interleaving. The flexibility enhances their appeal for practical implementation. The mathematical tools come from the theory of groups in the form of additive and multiplicative characters of finite fields.

cs.IT

New Successor Rules to Efficiently Produce Exponentially Many Binary de Bruijn Sequences

We put forward new general criteria to design successor rules that generate binary de Bruijn sequences. Prior fast algorithms based on successor rules in the literature are then shown to be special instances. We implemented the criteria to join the cycles generated by a number of simple feedback shift registers (FSRs) of order $n$. These include the pure cycling register (PCR) and the pure summing register (PSR). For the PCR, we define a transitive relation on its cycles, based on their weights. We also extend the choices of conjugate states by using shift operations. For the PSR, we define three distinct transitive relations on its cycles, namely a run order, a necklace order, and a mixed order. Using the new orders, we propose numerous classes of successor rules. Each class efficiently generates a number, exponential in $n$, of binary de Bruijn sequences. Producing the next bit in each such sequence takes $O(n)$ memory and $O(n)$ time. We implemented computational routines to confirm the claims.

cs.IT

A Graph Joining Greedy Approach to Binary de Bruijn Sequences

Using greedy algorithms to generate de Bruijn sequences is a classical approach that has produced numerous interesting theoretical results. This paper investigates an algorithm which we call the Generalized Prefer-Opposite (GPO). It includes all prior greedy algorithms, with the exception of the Fleury Algorithm applied on the de Bruijn graph, as specific instances. The GPO Algorithm can produce any binary periodic sequences with nonlinear complexity at least two on input a pair of suitable feedback function and initial state. In particular, a sufficient and necessary condition for the GPO Algorithm to generate binary de Bruijn sequences is established. This requires the use of feedback functions with a unique cycle or loop in their respective state graphs. Moreover, we discuss modifications to the GPO Algorithm to handle more families of feedback functions whose state graphs have multiple cycles or loops. These culminate in a graph joining method. Several large classes of feedback functions are subsequently used to illustrate how the GPO Algorithm and its modification into the Graph Joining Prefer-Opposite (GJPO) Algorithm work in practice.

cs.IT