default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKoichi Betsumiya
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j15]Koichi Betsumiya, Masaaki Harada, Akihiro Munemasa:
A Complete Classification of Doubly Even Self-dual Codes of Length 40. Electron. J. Comb. 19(3): 18 (2012)- [j14]Koichi Betsumiya, Akihiro Munemasa:
On triply even binary codes. J. Lond. Math. Soc. 86(1): 1-16 (2012) - 2011
- [j13]Koichi Betsumiya, Masaaki Harada, Hiroshi Kimura:
Hadamard matrices of order 32 and extremal ternary self-dual codes. Des. Codes Cryptogr. 58(2): 203-214 (2011)
2000 – 2009
- 2009
- [c3]Koichi Betsumiya, Rowena Alma L. Betty, Akihiro Munemasa:
Mass Formula for Even Codes over. IMACC 2009: 65-77 - 2008
- [j12]Koichi Betsumiya:
Minimum Lee weights of Type II codes over I. Discret. Math. 308(14): 3018-3022 (2008) - 2005
- [j11]Koichi Betsumiya, YoungJu Choie:
Ozeki Polynomials and Jacobi Forms. Ars Comb. 77 (2005) - [j10]Koichi Betsumiya, YoungJu Choie
:
Codes over F4, Jacobi forms and Hilbert-Siegel modular forms over Q(sqrt(5)). Eur. J. Comb. 26(5): 629-650 (2005) - 2004
- [j9]Koichi Betsumiya, San Ling, Fidel R. Nemenzo:
Type II codes over F2m+uF2m. Discret. Math. 275(1-3): 43-65 (2004) - [j8]Koichi Betsumiya, YoungJu Choie:
Jacobi forms over totally real fields and type II codes over Galois rings GR(2m, f). Eur. J. Comb. 25(4): 475-486 (2004) - [j7]Koichi Betsumiya, Masaaki Harada:
Optimal self-dual codes over F2*F2 with respect to the Hamming weight. IEEE Trans. Inf. Theory 50(2): 356-358 (2004) - 2003
- [j6]Koichi Betsumiya, Masaaki Harada:
Formally Self-Dual Codes Related to Type II Codes. Appl. Algebra Eng. Commun. Comput. 14(2): 81-88 (2003) - [j5]Koichi Betsumiya, T. Aaron Gulliver, Masaaki Harada:
Extremal Self-Dual Codes over F2 × F2. Des. Codes Cryptogr. 28(2): 171-186 (2003) - [j4]Koichi Betsumiya, Stelios Georgiou, T. Aaron Gulliver, Masaaki Harada, Christos Koukouvinos:
On self-dual codes over some prime fields. Discret. Math. 262(1-3): 37-58 (2003) - 2001
- [j3]Koichi Betsumiya, Masaaki Harada:
Binary Optimal Odd Formally Self-Dual Codes. Des. Codes Cryptogr. 23(1): 11-22 (2001) - [j2]Koichi Betsumiya, Masaaki Harada:
Classification of Formally Self-Dual Even Codes of Lengths up to 16. Des. Codes Cryptogr. 23(3): 325-332 (2001) - [j1]Koichi Betsumiya, T. Aaron Gulliver, Masaaki Harada, Akihiro Munemasa:
On type II codes over F4. IEEE Trans. Inf. Theory 47(6): 2242-2248 (2001) - [c2]Koichi Betsumiya, Masaaki Harada, Akihiro Munemasa:
Type II Codes over F2r. AAECC 2001: 102-111
1990 – 1999
- 1999
- [c1]Koichi Betsumiya, T. Aaron Gulliver, Masaaki Harada:
Binary Optimal Linear Rate 1/2 Codes. AAECC 1999: 462-471
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 2025-01-07 01:14 CET 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:
