default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJuriaan Simonis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2003
[j21]Iliya Bouyukliev
, Juriaan Simonis:
Some New Results on Optimal Codes Over F5. Des. Codes Cryptogr. 30(1): 97-111 (2003)- 2002
- [j20]Sugi Guritman, Juriaan Simonis:
Restrictions on the weight distribution of quaternary linear codes. Electron. Notes Discret. Math. 11: 734-741 (2002) - [j19]Iliya Bouyukliev, Juriaan Simonis:
Some new results for optimal ternary linear codes. IEEE Trans. Inf. Theory 48(4): 981-985 (2002) - 2001
- [j18]Sugi Guritman, Femke Hoogweg, Juriaan Simonis:
The degree of functions and weights in linear codes. Discret. Appl. Math. 111(1-2): 87-102 (2001) - [j17]Johannes G. Maks, Juriaan Simonis:
Polynomial invariants for binary linear codes. Electron. Notes Discret. Math. 6: 310-317 (2001) - 2000
- [j16]Johannes G. Maks, Juriaan Simonis:
Optimal Subcodes of Second Order Reed-Muller Codes and Maximal Linear Spaces of Bivectors of Maximal Rank. Des. Codes Cryptogr. 21(1/3): 165-180 (2000) - [j15]Juriaan Simonis:
The [23, 14, 5] Wagner code is unique. Discret. Math. 213(1-3): 269-282 (2000) - [j14]Juriaan Simonis:
Adding a parity-check bit. IEEE Trans. Inf. Theory 46(4): 1544-1545 (2000)
1990 – 1999
- 1999
- [j13]David B. Jaffe, Juriaan Simonis:
New binary linear codes which are dual transforms of good codes. IEEE Trans. Inf. Theory 45(6): 2136-2137 (1999) - [j12]Stefan M. Dodunekov, Sugi Guritman, Juriaan Simonis:
Some new results on the minimum length of binary linear codes of dimension nine. IEEE Trans. Inf. Theory 45(7): 2543-2546 (1999) - 1998
- [j11]Stefan M. Dodunekov, Juriaan Simonis:
Codes and Projective Multisets. Electron. J. Comb. 5 (1998) - [j10]Juriaan Simonis, Alexei E. Ashikhmin:
Almost Affine Codes. Des. Codes Cryptogr. 14(2): 179-197 (1998) - [j9]Ernst M. Gabidulin, Juriaan Simonis:
Metrics Generated by Families of Subspaces. IEEE Trans. Inf. Theory 44(3): 1336-1341 (1998) - 1997
- [j8]Thomas H. E. Ericson, Juriaan Simonis, Hannu Tarnanen, Victor A. Zinoviev:
F-partitions of Cyclic Groups. Appl. Algebra Eng. Commun. Comput. 8(5): 387-393 (1997) - 1994
- [j7]Juriaan Simonis:
The Effective Length of Subcodes. Appl. Algebra Eng. Commun. Comput. 5: 371-377 (1994) - [j6]Juriaan Simonis:
Restrictions on the weight distribution of binary linear codes imposed by the structure of Reed-Muller codes. IEEE Trans. Inf. Theory 40(1): 194-196 (1994) - 1992
- [j5]Juriaan Simonis:
The [18, 9, 6] code is unique. Discret. Math. 106-107: 439-448 (1992) - [j4]Juriaan Simonis:
On generator matrices of codes. IEEE Trans. Inf. Theory 38(2): 516- (1992) - 1991
- [j3]Juriaan Simonis, Cornelis de Vroedt:
A Simple Proof of the Delsarte Inequalities. Des. Codes Cryptogr. 1(1): 77-82 (1991) - 1990
- [c2]Juriaan Simonis:
A Description of the [16, 7, 6] Codes. AAECC 1990: 24-35
1980 – 1989
- 1988
- [j2]Juriaan Simonis:
The minimal covering radius t[15, 6] of a six-dimensional binary linear code of length 15 is equal to 4. IEEE Trans. Inf. Theory 34(5): 1344-1345 (1988) - [c1]Juriaan Simonis:
Covering Radius: Improving on the Sphere-Covering Bound. AAECC 1988: 377-385 - 1987
- [j1]Juriaan Simonis:
Binary even [25, 15, 6] codes do not exist. IEEE Trans. Inf. Theory 33(1): 151-153 (1987)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
