Results 11 to 20 of about 3,225,248 (329)
Product perfect codes and steganography [PDF]
Digital Signal Processing, 2009 A new coding technique to be used in steganography is evaluated. The performance of this new technique is computed and comparisons with the well-known theoretical upper bound, Hamming upper bound and basic LSB are established.
Helena Rifà-Pous, Josep Rifà
openaire +3 more sources
Perfect codes as isomorphic spaces
Discrete Mathematics, 2006 Linear equivalence between perfect codes is defined. This definition gives the concept of general perfect 1-error correcting binary codes. These are defined as 1-error correcting perfect binary codes, with the difference that the set of errors is not the
Hessler, Martin,
exaly +3 more sources
Discrete Mathematics, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lobstein, Antoine C.
openaire +2 more sources
Journal of Combinatorial Theory, Series B, 1986 We present a generalization of the notion of perfect codes - perfect codes over graphs. We show an infinite family of 1-perfect codes in second powers of graphs and we prove the nonexistence of nontrivial 1- perfect codes over complete bipartite graphs with at least three vertices.
Kratochvíl, Jan
openaire +3 more sources
Discrete Mathematics, 1972 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jean-Marie Goethals, S. L. Snover
openaire +2 more sources
On the non-existence of perfect and nearly perfect codes
Discrete Mathematics, 1982 AbstractThe main result of the paper is the proof of the non-existence of a class of completely regular codes in certain distance-regular graphs. Corollaries of this result establish the non-existence of perfect and nearly perfect codes in the infinite families of distance-regular graphs J(2b + 1, b) and J(2b+2,b).
Hammond, Peter
openaire +2 more sources
Discrete Mathematics, 1972 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lenstra, H.W.
openaire +4 more sources
Perfect codes in vertex-transitive graphs [PDF]
Journal of Combinatorial Theory, 2021 Given a graph $\Gamma$, a perfect code in $\Gamma$ is an independent set $C$ of vertices of $\Gamma$ such that every vertex outside of $C$ is adjacent to a unique vertex in $C$, and a total perfect code in $\Gamma$ is a set $C$ of vertices of $\Gamma ...
Yuting Wang, Junyang Zhang
semanticscholar +1 more source
Total perfect codes in graphs realized by commutative rings [PDF]
Transactions on Combinatorics, 2022 Let $R$ be a commutative ring with unity not equal to zero and let $\Gamma(R)$ be a zero-divisor graph realized by $R$. For a simple, undirected, connected graph $G = (V, E)$, a {\it total perfect code} denoted by $C(G)$ in $G$ is a subset $C(G ...
Rameez Raja
doaj +1 more source
PyMatching: A Python Package for Decoding Quantum Codes with Minimum-Weight Perfect Matching [PDF]
ACM Transactions on Quantum Computing, 2021 This article introduces PyMatching, a fast open-source Python package for decoding quantum error-correcting codes with the minimum-weight perfect matching (MWPM) algorithm. PyMatching includes the standard MWPM decoder as well as a variant, which we call
O. Higgott
semanticscholar +1 more source