Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Juriaan Simonis"'
Autor:
Juriaan Simonis, Iliya Bouyukliev
Publikováno v:
Designs, Codes and Cryptography. 30:97-111
We present some results on almost maximum distance separable (AMDS) codes and Griesmer codes of dimension 4 over over the field of order 5. We prove that no AMDS code of length 13 and minimum distance 5 exists, and we give a classification of some AM
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::76af025c6c7b760707e0eb842233f7c1
https://doi.org/10.1023/a:1024763410967
https://doi.org/10.1023/a:1024763410967
Autor:
Sugi Guritman, Juriaan Simonis
Publikováno v:
Electronic Notes in Discrete Mathematics. 11:734-741
This paper describes some nonexistence results for quaternary linear codes. The standard linear program is strengthened with constraints from the weight distribution of binary Reed-Muller codes.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3e54029777f0cfe4e587e1df1b8ab7f6
https://doi.org/10.1016/s1571-0653(04)00117-9
https://doi.org/10.1016/s1571-0653(04)00117-9
Autor:
Iliya Bouyukliev, Juriaan Simonis
Publikováno v:
IEEE Transactions on Information Theory. 48:981-985
Let d/sub 3/(n,k) be the maximum possible minimum Hamming distance of a ternary [n,k,d]-code for given values of n and k. We describe a package for code extension and use this to prove some new exact values of d/sub 3/(n,k). Moreover, we classify the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5134ba69cd5f205cf64238ca46c6244b
https://doi.org/10.1109/18.992814
https://doi.org/10.1109/18.992814
Autor:
Johannes G. Maks, Juriaan Simonis
Publikováno v:
Electronic Notes in Discrete Mathematics. 6:310-317
A new family of invariants for binary linear codes is introduced. In the 3-dimensional case a particular set of the new invariants is shown to determine code equivalence. Each selection of a set of invariants gives rise to a generalized weight distri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7af660a9ead6b08be89aa820313a3b8b
https://doi.org/10.1016/s1571-0653(04)00182-9
https://doi.org/10.1016/s1571-0653(04)00182-9
Publikováno v:
Discrete Applied Mathematics, 111(1-2), 87-102. Elsevier
Properties of the weight distribution of low-dimensional generalized Reed–Muller codes are used to obtain restrictions on the weight distribution of linear codes over arbitrary fields. These restrictions are used in non-existence proofs for ternary
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eef30eb466929db3c9d2803c251c0d8a
https://doi.org/10.1016/s0166-218x(00)00346-2
https://doi.org/10.1016/s0166-218x(00)00346-2
Autor:
Juriaan Simonis, Johannes G. Maks
Publikováno v:
Designs, Codes and Cryptography. 21:165-180
There are exactly two non-equivalent [32,11,12]-codes in the binary Reed-Muller code {\cal{RM}}(2,5) which contain {\cal{RM}}(1,5) and have the weight set \{0,12,16,20,32\}. Alternatively, the 4-spaces in the projective space {\Bbb{P}}(\Lambda^{2}{\B
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4597e42f0e64e152017d377826f8fa8d
https://doi.org/10.1023/a:1008343829143
https://doi.org/10.1023/a:1008343829143
Autor:
Juriaan Simonis
Publikováno v:
Discrete Mathematics, 213(1-3), 269-282. Elsevier
The paper contains a proof that all binary linear [23 ,14, 5] codes are equivalent to the code with these parameters that has been discovered by Wagner.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ead5681d597c6c618c1ac53ac6b6d89d
https://doi.org/10.1016/S0012-365X(99)00187-9
https://doi.org/10.1016/S0012-365X(99)00187-9
Publikováno v:
Linear Algebra and Its Applications, 307(1-3), 119-129. Elsevier
The paper discusses some ways to strengthen (nonasymptotically) the Gilbert–Varshamov bound for linear codes. The unifying idea is to study a certain graph constructed on vectors of low weight in the cosets of the code, which we call the Varshamov
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3bd9ece163bb451b396aa67b57f7dad5
https://doi.org/10.1016/S0024-3795(99)00271-2
https://doi.org/10.1016/S0024-3795(99)00271-2
Autor:
Juriaan Simonis, E.M. Gabidulin
Publikováno v:
IEEE Transactions on Information Theory, 44(3), 1336-1341. Institute of Electrical and Electronics Engineers
A new family of metrics is introduced. Each of these is defined by a spanning set F of linear subspaces of a finite vector space. The norm of a vector is defined as the size of a minimal subset of F whose span contains this vector. Some examples and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7c4acba770ed3e622df42df2a0962f29
https://research.tue.nl/en/publications/b1ba4d03-9668-4871-91fb-e42ee7e096dd
https://research.tue.nl/en/publications/b1ba4d03-9668-4871-91fb-e42ee7e096dd
Autor:
Juriaan Simonis, Alexey Ashikhmin
Publikováno v:
Linear Algebra and Its Applications, 269(1-3), 197-217. Elsevier
Two new proofs of the Delsarte inequalities for unrestricted codes over an arbitrary alphabet are presented. These inequalities are strengthened for the case that the size of the code is not divisible by the alphabet size.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::04800c4db5ac3980ccceefbaa9069517
https://doi.org/10.1016/S0024-3795(97)00065-7
https://doi.org/10.1016/S0024-3795(97)00065-7