Results 41 to 50 of about 3,225,248 (329)
No More Perfect Codes: Classification of Perfect Quantum Codes
CoRR, 2009 3 pages, no ...
Zhuo Li 0007, Li-Juan Xing
openaire +3 more sources
On the classification of perfect codes : side class structures
, 2006 The side class structure of a perfect 1-error correcting binary code (hereafter referred to as a perfect code) C describes the linear relations between the coset representatives of the kernel of C.
Hessler, Martin +2 more
core +1 more source
The partial order of perfect codes associated to a perfect code
Advances in Mathematics of Communications, 2007 It is clarified whether or not ''full rank perfect 1-error correcting binary codes act like primes in the family of all perfect 1-error correcting binary codes''. Thereby the well known connection between perfect 1-error correcting binary codes and tilings will be discussed and used.
openaire +1 more source
Optimum distance flag codes from spreads via perfect matchings in graphs
Journal of Algebraic Combinatorics, 2020 In this paper, we study flag codes on the vector space Fqn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength ...
C. Alonso-González +2 more
semanticscholar +1 more source
The (non-)existence of perfect codes in Lucas cubes
پژوهشهای ریاضی, 2022 A Fibonacci string of length $n$ is a binary string $b = b_1b_2ldots b_n$ in which for every $1 leq i < n$, $b_icdot b_{i+1} = 0$. In other words, a Fibonacci string is a binary string without 11 as a substring.
Azam Ghaleh Agha Babai,
doaj
Concurrent Codes: A Holographic-Type Encoding Robust against Noise and Loss. [PDF]
PLoS ONE, 2016 Concurrent coding is an encoding scheme with 'holographic' type properties that are shown here to be robust against a significant amount of noise and signal loss.
David M Benton
doaj +1 more source
Electronic Notes in Discrete Mathematics, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Embedding in q-ary 1-perfect codes and partitions [PDF]
Discrete Mathematics, 2014 It is proved that every 1-error-correcting code over a finite field can be embedded in a 1-perfect code of some larger length. Embedding in this context means that the original code is a subcode of the resulting 1-perfect code and can be obtained from it
D. Krotov, E. Sotnikova
semanticscholar +1 more source
Construction of Fractional Repetition Codes with Variable Parameters for Distributed Storage Systems
Entropy, 2016 In this paper, we propose a new class of regular fractional repetition (FR) codes constructed from perfect difference families and quasi-perfect difference families to store big data in distributed storage systems.
Hosung Park, Young-Sik Kim
doaj +1 more source
Perfect 2-colorings of the cubic graphs of order less than or equal to 10
AKCE International Journal of Graphs and Combinatorics, 2020 Perfect coloring is a generalization of the notion of completely regular codes, given by Delsarte. A perfect -coloring of a graph with colors is a partition of the vertex set of into m parts , . . .
Mehdi Alaeiyan, Ayoob Mehrabani
doaj +1 more source