default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHaibin Kan
- > Home > Persons > Haibin Kan
Publications
- 2015
[j44]Xiaodong Liu, Yuan Li, Haibin Kan:
On the Minimum Decoding Delay of Balanced Complex Orthogonal Designs. IEEE Trans. Inf. Theory 61(1): 696-699 (2015)- 2014
- [j38]Haibin Kan, Yuan Li, Yue Zhao:
Capacity factors in a point-to-point network. Inf. Sci. 285: 24-34 (2014) - 2013
- [j36]Yuan Li, Chen Yuan
, Haibin Kan:
Explicit-form complex orthogonal design for space-time block codes. Sci. China Inf. Sci. 56(6): 1-10 (2013) - [i6]Xiaodong Liu, Yuan Li, Haibin Kan:
On the Minimum Decoding Delay of Balanced Complex Orthogonal Design. CoRR abs/1312.7650 (2013) - 2012
- [j24]Yuan Li, Haibin Kan:
Complex Orthogonal Designs With Forbidden 2,×,2 Submatrices. IEEE Trans. Inf. Theory 58(7): 4825-4836 (2012) - [j23]Hui Wang, Jie Peng, Yuan Li, Haibin Kan:
On 2k -Variable Symmetric Boolean Functions With Maximum Algebraic Immunity k. IEEE Trans. Inf. Theory 58(8): 5612-5624 (2012) - [c10]Yuan Li, Chen Yuan, Haibin Kan:
Novel constructions of complex orthogonal designs for space-time block codes. INFOCOM 2012: 2167-2173 - [i5]Yuan Li, Yue Zhao, Haibin Kan:
Capacity Factors of a Point-to-point Network. CoRR abs/1201.0435 (2012) - 2011
- [j22]Yuan Li, Hui Wang, Haibin Kan:
Constructing Even-Variable Symmetric Boolean Functions with High Algebraic Immunity. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(1): 362-366 (2011) - [j19]Yuan Li, Haibin Kan, Kokichi Futatsugi:
A Note on "On the Construction of Boolean Functions with Optimal Algebraic Immunity". IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(9): 1877-1880 (2011) - [i4]Yuan Li, Haibin Kan:
Complex Orthogonal Designs with Forbidden 2 × 2 Submatrices. CoRR abs/1107.3268 (2011) - [i3]Yuan Li, Haibin Kan:
On the nonexistence of $[\binom{2m}{m-1}, 2m, \binom{2m-1}{m-1}]$, $m$ odd, complex orthogonal design. CoRR abs/1109.2891 (2011) - [i2]Yuan Li, Hui Wang, Haibin Kan:
Constructing and Counting Even-Variable Symmetric Boolean Functions with Algebraic Immunity not Less Than $d$. CoRR abs/1110.3875 (2011) - [i1]Hui Wang, Jie Peng, Yuan Li, Haibin Kan:
On $2k$-Variable Symmetric Boolean Functions with Maximum Algebraic Immunity $k$. CoRR abs/1111.2121 (2011) - 2010
- [j15]Yuan Li, Haibin Kan, Chen Yuan, Huanfei Ma:
The maximal rates and minimal decoding delay of more general complex orthogonal designs. Sci. China Inf. Sci. 53(9): 1826-1832 (2010) - [j13]Yuan Li, Min Yang, Haibin Kan:
Constructing and Counting Boolean Functions on Even Variables with Maximum Algebraic Immunity. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(3): 640-643 (2010) - 2008
- [c7]Yuan Li, Zheng Huang, Xin Wang, Haibin Kan:
Searching for Capacity Factors is NP-Complete. ICC 2008: 1431-1435
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-09-07 02:04 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:
