Results 21 to 30 of about 3,225,248 (329)
Perfect and Quasi-Perfect Codes for the Bosonic Classical-Quantum Channel
IEEE Transactions on Quantum Engineering, 2023 In this article, we explore perfect and quasi-perfect codes for the Bosonic channel, where information is generated by a laser and conveyed in the form of coherent states.
Andreu Blasco Coll, Javier R. Fonollosa
doaj +1 more source
Perfect Codes in Cayley Sum Graphs [PDF]
Electronic Journal of Combinatorics, 2020 A subset $C$ of the vertex set of a graph $\Gamma$ is called a perfect code of $\Gamma$ if every vertex of $\Gamma$ is at distance no more than one to exactly one vertex in $C$. Let $A$ be a finite abelian group and $T$ a square-free subset of $A$.
Xuanlong Ma, Kaishun Wang, Yuefeng Yang
semanticscholar +1 more source
No invariant perfect qubit codes
Journal of High Energy Physics, 2023 Perfect tensors describe highly entangled quantum states that have attracted particular attention in the fields of quantum information theory and quantum gravity. In loop quantum gravity, the natural question arises whether SU(2) invariant tensors, which
Refik Mansuroglu, Hanno Sahlmann
doaj +1 more source
Perfect codes in some products of graphs
Electronic Journal of Graph Theory and Applications, 2021 A r-perfect code in a graph G = (V(G),E(G)) is a subset C of V(G) for which the balls of radius r centered at the vertices of C form a partition of V(G).
Samane Bakaein +2 more
doaj +1 more source
The maximum cardinality of trifferent codes with lengths 5 and 6
Examples and Counterexamples, 2022 A code C⊆{0,1,2}nis said to be trifferent with length n when for any three distinct elements of C there exists a coordinate in which they all differ. Defining T(n)as the maximum cardinality of trifferent codes with length n, T(n)is unknown for n≥5.
Stefano Della Fiore +2 more
doaj +1 more source
Covering codes in Sierpinski graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 Graphs and ...
Laurent Beaudou +4 more
doaj +1 more source
On Linear Perfect b-Symbol Codes over Finite Fields
Mathematics, 2023 Motivated by the application of high-density data storage technologies, Cassuto and Blaum introduced codes for symbol-pair read channels in 2011, and Yaakobi et al. generalized the coding framework to that for b-symbol read channels where b≥2 in 2016. In
Kanat Abdukhalikov +2 more
doaj +1 more source
On subgroup perfect codes in Cayley graphs [PDF]
European journal of combinatorics (Print), 2019 Let $\Gamma$ be a graph with vertex set $V(\Gamma)$. A subset $C$ of $V(\Gamma)$ is called a perfect code in $\Gamma$ if $C$ is an independent set of $\Gamma$ and every vertex in $V(\Gamma)\setminus C$ is adjacent to exactly one vertex in $C$.
Junyang Zhang, Sanming Zhou
semanticscholar +1 more source
Advances in Mathematics of Communications, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Luciano Panek +3 more
openaire +3 more sources
Characterization of subgroup perfect codes in Cayley graphs [PDF]
Discrete Mathematics, 2019 A subset $C$ of the vertex set of a graph $\Gamma$ is called a perfect code in $\Gamma$ if every vertex of $\Gamma$ is at distance no more than $1$ to exactly one vertex of $C$.
Jiyong Chen, Yanpeng Wang, Binzhou Xia
semanticscholar +1 more source