Results 291 to 300 of about 3,225,248 (329)
Local duality theorem for q-ary 1-perfect codes
Des. Codes Cryptogr., 2014 Local duality theorem; Local weight enumerator; q-ary 1-perfect ...
Soohak Choi, J. Hyun, H. Kim
semanticscholar +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005., 2005
A general construction for perfect integer codes is provided, which allows to efficiently compute such codes. The method is applied to investigate in detail the special error set {plusmn1, plusmna, plusmnb, plusmnc,} interesting for single error correction of peak shifts and codes defined on ...
openaire +1 more source
A general construction for perfect integer codes is provided, which allows to efficiently compute such codes. The method is applied to investigate in detail the special error set {plusmn1, plusmna, plusmnb, plusmnc,} interesting for single error correction of peak shifts and codes defined on ...
openaire +1 more source
Perfect codes in Euclidean lattices
Computational and Applied Mathematics, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Giselle Strey +2 more
openaire +1 more source
Total perfect codes in Cayley graphs
Des. Codes Cryptogr., 2016A total perfect code in a graph $$\Gamma $$Γ is a subset C of $$V(\Gamma )$$V(Γ) such that every vertex of $$\Gamma $$Γ is adjacent to exactly one vertex in C. We give necessary and sufficient conditions for a conjugation-closed subset of a group to be a
Sanming Zhou
semanticscholar +1 more source
Involutions in Binary Perfect Codes
IEEE Transactions on Information Theory, 2011Given a 1-perfect code C, the group of symmetries of C, Sym(C)={π ∈ Sn | π(C)=C} , is a subgroup of the group of automorphisms of C. In this paper, we focus on symmetries of order two, i.e., involutions. Let InvF(C) ⊆ Sym(C) be the set of involutions that stabilize F pointwise.
Cristina Fernández-Córdoba +2 more
openaire +1 more source
IEEE Transactions on Information Theory, 2004
In his pioneering work from 1973, Delsarte conjectured that there are no nontrivial perfect codes in the Johnson scheme. Many attempts were made, during the years which followed, to prove Delsarte's conjecture, but only partial results have been obtained. We survey all these attempts, and prove some new results having the same flavor. We also present a
Tuvi Etzion, Moshe Schwartz 0001
openaire +1 more source
In his pioneering work from 1973, Delsarte conjectured that there are no nontrivial perfect codes in the Johnson scheme. Many attempts were made, during the years which followed, to prove Delsarte's conjecture, but only partial results have been obtained. We survey all these attempts, and prove some new results having the same flavor. We also present a
Tuvi Etzion, Moshe Schwartz 0001
openaire +1 more source
On the subgroup perfect codes in Cayley graphs
Designs, Codes and Cryptography, 2022Yasamin Khaefi, Z. Akhlaghi, B. Khosravi
semanticscholar +1 more source
On perfect codes for an additive channel
Problems of Information Transmission, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vladimir K. Leont'ev +2 more
openaire +2 more sources
State estimation codes for perfect secrecy
IEEE Conference on Decision and Control, 2017We study the problem of remote state estimation, in the presence of a passive eavesdropper. An authorized user estimates the state of an unstable linear plant, based on the packets received from a sensor, while the packets may also be intercepted by the ...
A. Tsiamis +2 more
semanticscholar +1 more source