Additive complementary dual codes over $\F_4$

• URL: http://arxiv.org/abs/2207.01938v1
• Date: Tue, 5 Jul 2022 10:23:32 GMT
• Title: Additive complementary dual codes over $\F_4$
• Authors: Minjia Shi, Na Liu, Jon-Lark Kim, Patrick Sol\'e
• Abstract summary: A linear code is linear complementary dual (LCD) if it meets its dual trivially. An additive code over $F_4$ is additive complementary dual (ACD) if it meets its dual trivially. All the techniques and problems used to study LCD codes are potentially relevant to ACD codes.
• Score: 15.3635129778594
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: A linear code is linear complementary dual (LCD) if it meets its dual trivially. LCD codes have been a hot topic recently due to Boolean masking application in the security of embarked electronics (Carlet and Guilley, 2014). Additive codes over $\F_4$ are $\F_4$-codes that are stable by codeword addition but not necessarily by scalar multiplication. An additive code over $\F_4$ is additive complementary dual (ACD) if it meets its dual trivially. The aim of this research is to study such codes which meet their dual trivially. All the techniques and problems used to study LCD codes are potentially relevant to ACD codes. Interesting constructions of ACD codes from binary codes are given with respect to the trace Hermitian and trace Euclidean inner product. The former product is relevant to quantum codes.

Related papers

• Optimal Quantum $(r,δ)$-Locally Repairable Codes From Matrix-Product Codes [52.3857155901121]
  We study optimal quantum $(r,delta)$-LRCs from matrix-product (MP) codes.<n>We present five infinite families of optimal quantum $(r,delta)$-LRCs with flexible parameters.
  arXiv  Detail & Related papers  (2025-08-05T16:05:14Z)
• An Empirical Study on the Effectiveness of Large Language Models for Binary Code Understanding [50.17907898478795]
  This work proposes a benchmark to evaluate the effectiveness of Large Language Models (LLMs) in real-world reverse engineering scenarios. Our evaluations reveal that existing LLMs can understand binary code to a certain extent, thereby improving the efficiency of binary code analysis.
  arXiv  Detail & Related papers  (2025-04-30T17:02:06Z)
• Moderate-length lifted quantum Tanner codes [11.310502327308578]
  We introduce new families of quantum Tanner codes, a class of quantum codes first appeared in the work of Leverrier and Z'emor. We present several explicit families, and identify instances of moderate length quantum codes which are degenerate, have low check weight, and for which the distance surpasses the square root of the code length.
  arXiv  Detail & Related papers  (2025-02-27T17:23:53Z)
• Coxeter codes: Extending the Reed-Muller family [59.90381090395222]
  We introduce a class of binary linear codes that generalizes the RM family by replacing the domain $mathbbZm$ with an arbitrary finite Coxeter group.<n> Coxeter codes also give rise to a family of quantum codes for which closed diagonal $Z$ rotations can perform non-trivial logic.
  arXiv  Detail & Related papers  (2025-02-20T17:16:28Z)
• Asymptotically good CSS-T codes and a new construction of triorthogonal codes [0.0]
  We propose a new systematic construction of CSS-T codes from any given CSS code using a map $phi$.<n>We prove the existence ofally good binary CSS-T codes, and ofally good quantum LDPC CSS-T codes.<n>An immediate application of these codes in dealing with coherent noise is discussed.
  arXiv  Detail & Related papers  (2024-12-11T18:03:58Z)
• Letting the tiger out of its cage: bosonic coding without concatenation [3.2055955766884465]
  Cat codes are encodings into a single photonic or phononic mode that offer a promising avenue for hardware-efficient fault-tolerant quantum computation. We construct multimode codes with similar linear constraints using any two integer matrices satisfying the homological condition of a quantum rotor code. Just like the pair-cat code, syndrome extraction can be performed in tandem with stabilizing dissipation using current superconducting-circuit designs.
  arXiv  Detail & Related papers  (2024-11-14T18:38:33Z)
• Decoding Quasi-Cyclic Quantum LDPC Codes [23.22566380210149]
  Quantum low-density parity-check (qLDPC) codes are an important component in the quest for fault tolerance. Recent progress on qLDPC codes has led to constructions which are quantumally good, and which admit linear-time decoders to correct errors affecting a constant fraction of codeword qubits. In practice, the surface/toric codes, which are the product of two repetition codes, are still often the qLDPC codes of choice.
  arXiv  Detail & Related papers  (2024-11-07T06:25:27Z)
• Expanding self-orthogonal codes over a ring $\Z_4$ to self-dual codes and unimodular lattices [15.449427879628143]
  We show that all self-dual codes over $Z_4$ of lengths $4$ to $8$ can be constructed this way. We have found five new self-dual codes over $Z_4$ of lengths $27, 28, 29, 33,$ and $34$ with the highest Euclidean weight $12$.
  arXiv  Detail & Related papers  (2024-08-31T09:38:42Z)
• SSIP: automated surgery with quantum LDPC codes [55.2480439325792]
  We present Safe Surgery by Identifying Pushouts (SSIP), an open-source lightweight Python package for automating surgery between qubit CSS codes. Under the hood, it performs linear algebra over $mathbbF$ governed by universal constructions in the category of chain complexes. We show that various logical measurements can be performed cheaply by surgery without sacrificing the high code distance.
  arXiv  Detail & Related papers  (2024-07-12T16:50:01Z)
• How Far Have We Gone in Binary Code Understanding Using Large Language Models [51.527805834378974]
  We propose a benchmark to evaluate the effectiveness of Large Language Models (LLMs) in binary code understanding. Our evaluations reveal that existing LLMs can understand binary code to a certain extent, thereby improving the efficiency of binary code analysis.
  arXiv  Detail & Related papers  (2024-04-15T14:44:08Z)
• Maximally Extendable Sheaf Codes [5.439020425819001]
  We study sheaf codes, a type of linear codes with a fixed hierarchical collection of local codes. We introduce a new property of a sheaf code, called maximalibility, which ensures that within class of codes on the same coded space, we encounter as few obstructions as possible.
  arXiv  Detail & Related papers  (2024-03-06T12:20:49Z)
• Homological Quantum Rotor Codes: Logical Qubits from Torsion [51.9157257936691]
  homological quantum rotor codes allow one to encode both logical rotors and logical qudits in the same block of code. We show that the $0$-$pi$-qubit as well as Kitaev's current-mirror qubit are indeed small examples of such codes.
  arXiv  Detail & Related papers  (2023-03-24T00:29:15Z)
• CSS code surgery as a universal construction [51.63482609748332]
  We define code maps between Calderbank-Shor-Steane (CSS) codes using maps between chain complexes. We describe code surgery between such codes using a specific colimit in the category of chain complexes.
  arXiv  Detail & Related papers  (2023-01-31T16:17:25Z)
• Morphing quantum codes [77.34726150561087]
  We morph the 15-qubit Reed-Muller code to obtain the smallest known stabilizer code with a fault-tolerant logical $T$ gate. We construct a family of hybrid color-toric codes by morphing the color code.
  arXiv  Detail & Related papers  (2021-12-02T17:43:00Z)
• KO codes: Inventing Nonlinear Encoding and Decoding for Reliable Wireless Communication via Deep-learning [76.5589486928387]
  Landmark codes underpin reliable physical layer communication, e.g., Reed-Muller, BCH, Convolution, Turbo, LDPC and Polar codes. In this paper, we construct KO codes, a computationaly efficient family of deep-learning driven (encoder, decoder) pairs. KO codes beat state-of-the-art Reed-Muller and Polar codes, under the low-complexity successive cancellation decoding.
  arXiv  Detail & Related papers  (2021-08-29T21:08:30Z)
• Quantum error-correcting codes from matrix-product codes related to quasi-orthogonal and quasi-unitary matrices [18.763290930749235]
  Matrix-product codes over finite fields are an important class of long linear codes. The construction of matrix-product codes with certain self-orthogonality over finite fields is an effective way to obtain good $q$-ary quantum codes of large length.
  arXiv  Detail & Related papers  (2020-12-31T16:17:37Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.