English
Related papers

Related papers: A method for constructing quaternary Hermitian sel…

200 papers

There has been recent interest in the study of shortest self-orthogonal embeddings of binary linear codes, since many such codes are optimal self-orthogonal codes. Several authors have studied the length of a shortest self-orthogonal…

Information Theory · Computer Science 2025-11-10 Junmin An , Nathan Kaplan , Jon-Lark Kim , Jinquan Luo , Guodong Wang

We present several results on quantum codes over general alphabets (that is, in which the fundamental units may have more than 2 states). In particular, we consider codes derived from finite symplectic geometry assumed to have additional…

Quantum Physics · Physics 2007-05-23 Eric M. Rains

Let $\mathbb{F}_q$ be a finite field of $q$ elements, for some prime power $q$, and let $G$ be a finite group. A (left) group code, or simply a $G$-code, is a (left) ideal of the group algebra $\mathbb{F}_q[G]$. In this paper, we provide a…

Information Theory · Computer Science 2026-02-05 Miguel Sales-Cabrera , Xaro Soler-Escrivà , Víctor Sotomayor

This paper provides a new instance of quantum deletion error-correcting codes. This code can correct any single quantum deletion error, while our code is only of length 4. This paper also provides an example of an encoding quantum circuit…

Quantum Physics · Physics 2020-01-24 Manabu Hagiwara , Ayumu Nakayama

We propose a hybrid quantum-classical algorithm to compute approximate solutions of binary combinatorial problems. We employ a shallow-depth quantum circuit to implement a unitary and Hermitian operator that block-encodes the weighted…

Quantum Physics · Physics 2023-06-16 Natacha Kuete Meli , Florian Mannel , Jan Lellmann

Linear codes with few weights have applications in consumer electronics, communication, data storage system, secret sharing, authentication codes, association schemes, and strongly regular graphs. This paper first generalizes the method of…

Information Theory · Computer Science 2015-08-17 Chunming Tang , Nian Li , Yanfeng Qi , Zhengchun Zhou , Tor Helleseth

We study the locally recoverable codes on algebraic curves. In the first part of this article, we provide a bound of generalized Hamming weight of these codes. Whereas in the second part, we propose a new family of algebraic geometric LRC…

Commutative Algebra · Mathematics 2016-05-25 Edoardo Ballico , Chiara Marcolla

In the present paper, we show that if the dimension of an arbitrary algebraic geometry code over a finite field of even characters is slightly less than half of its length, then it is equivalent to an Euclidean self-orthogonal code.…

Information Theory · Computer Science 2013-08-19 Lingfei Jin , Chaoping Xing

In this paper, we give conditions for the existence of Hermitian self-dual $\Theta-$cyclic and $\Theta-$negacyclic codes over the finite chain ring $\mathbb{F}_q+u\mathbb{F}_q$. By defining a Gray map from $R=\mathbb{F}_q+u\mathbb{F}_q$ to…

Information Theory · Computer Science 2019-03-20 Zineb Hebbache , Kenza Guenda , N. Tugba Özzaim , Mehmet Özen , T. Aaron Gulliver

Stacked quantum memory is an architecture in which multiple layers of qubits are stacked. Quantum rank-metric codes are effective for error correction in stacked quantum memories. However, the previously proposed quantum Gabidulin codes…

Quantum Physics · Physics 2026-05-05 Ryota Nizuka , Ryutaroh Matsumoto

There are exactly two non-commutative rings of size $4$, namely, $E = \langle a, b ~\vert ~ 2a = 2b = 0, a^2 = a, b^2 = b, ab= a, ba = b\rangle$ and its opposite ring $F$. These rings are non-unital. A subset $D$ of $E^m$ is defined with…

Information Theory · Computer Science 2023-09-20 Vidya Sagar , Ritumoni Sarma

In this work, connected cubic planar bipartite graphs and related binary self-dual codes are studied. Binary self-dual codes of length 16 are obtained by face-vertex incidence matrices of these graphs. By considering their lifts to the ring…

Combinatorics · Mathematics 2016-10-04 Abidin Kaya

Recently, some infinite families of binary minimal and optimal linear codes are constructed from simplicial complexes by Hyun {\em et al}. Inspired by their work, we present two new constructions of codes over the ring $\Bbb F_2+u\Bbb F_2$…

Information Theory · Computer Science 2019-10-11 Yansheng Wu , Xiaomeng Zhu , Qin Yue

New bounds on the cardinality of permutation codes equipped with the Ulam distance are presented. First, an integer-programming upper bound is derived, which improves on the Singleton-type upper bound in the literature for some lengths.…

Information Theory · Computer Science 2015-04-21 Faruk Göloğlu , Jüri Lember , Ago-Erik Riet , Vitaly Skachek

A linear code is said to be self-orthogonal if it is contained in its dual. Self-orthogonal codes are of interest because of their important applications, such as for constructing linear complementary dual (LCD) codes and quantum codes. In…

Information Theory · Computer Science 2023-12-08 Dengcheng Xie , Shixin Zhu , Yang Li

Hybrid codes simultaneously encode both quantum and classical information into physical qubits. We give several general results about hybrid codes, most notably that the quantum codes comprising a genuine hybrid code must be impure and that…

Quantum Physics · Physics 2020-09-11 Andrew Nemec , Andreas Klappenecker

A quantum code is a subspace of a Hilbert space of a physical system chosen to be correctable against a given class of errors, where information can be encoded. Ideally, the quantum code lies within the ground space of the physical system.…

Quantum Physics · Physics 2014-12-16 Yingkai Ouyang

The weighted-Hamming metric generalizes the Hamming metric by assigning different weights to blocks of coordinates. It is well-suited for applications such as coding over independent parallel channels, each of which has a different level of…

Information Theory · Computer Science 2026-01-21 Sebastian Bitzer , Alberto Ravagnani , Violetta Weger

We construct a class of three-Lee-weight and two infinite families of five-Lee-weight codes over the ring $R=\mathbb{F}_2 +v\mathbb{F}_2 +v^2\mathbb{F}_2 +v^3\mathbb{F}_2 +v^4\mathbb{F}_2,$ where $v^5=1.$ The same ring occurs in the quintic…

Information Theory · Computer Science 2017-01-05 Yan Liu , Minjia Shi , Patrick Solé

We study quasi-cyclic codes of index 2 over finite fields. We give a classification of such codes. Their duals with respect to the Euclidean, symplectic and Hermitian inner products are investigated. We describe self-orthogonal and…

Information Theory · Computer Science 2026-01-21 Kanat Abdukhalikov , Askar S. Dzhumadil'daev , San Ling