default search action
Xiaomiao Wang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j25]Xiaomiao Wang
, Yu Fang, Tao Feng:
q-ary (1,k)-overlap-free codes with given restrictions. Discret. Math. 348(1): 114236 (2025) - 2024
- [j24]Xinyue Ming, Tao Feng
The existence of $(\mathbb {Z}_v,4,1)$-disjoint difference families. Des. Codes Cryptogr. 92(11): 3429-3446 (2024) - [j23]Chenya Zhao, Binwei Zhao, Yanxun Chang, Tao Feng
Cyclic relative difference families with block size four and their applications. J. Comb. Theory, Ser. A 206: 105890 (2024) - [j22]Qinlin Cai, Xiaomiao Wang
Constructions and Bounds for q-Ary (1, k)-Overlap-Free Codes. IEEE Trans. Inf. Theory 70(6): 4439-4444 (2024) - 2023
- [j21]Kailu Yang, Xiaomiao Wang
Some progress on optimal $ 2 $-D $ (n\times m,3,2,1) $-optical orthogonal codes. Adv. Math. Commun. 17(3): 605-625 (2023) - [j20]Menglong Zhang, Tao Feng
A note on a pair of orthogonal orthomorphisms of cyclic groups. Discret. Math. 346(1): 113122 (2023) - [j19]Lidong Wang, Tao Feng
Constructions for Multichannel Conflict-Avoiding Codes With AM-OPPTS Restriction. IEEE Trans. Inf. Theory 69(11): 7398-7413 (2023) - 2022
- [j18]Rong Pan
Difference matrices with five rows over finite abelian groups. Des. Codes Cryptogr. 90(2): 367-386 (2022) - [j17]Menglong Zhang, Tao Feng
The existence of cyclic (v, 4, 1)-designs. Des. Codes Cryptogr. 90(7): 1611-1628 (2022) - [j16]Lidong Wang, Lulu Cai, Tao Feng
Geometric orthogonal codes and geometrical difference packings. Des. Codes Cryptogr. 90(8): 1857-1879 (2022) - [j15]Chao Guo, Xiaomiao Wang
Cyclic balanced sampling plans excluding contiguous units with block size four. Discret. Math. 345(7): 112899 (2022) - 2021
- [j14]Tao Feng
Novák's conjecture on cyclic Steiner triple systems and its generalization. J. Comb. Theory A 184: 105515 (2021) - 2020
- [j13]Rong Pan, Tao Feng
Optimal optical orthogonal signature pattern codes with weight three and cross-correlation constraint one. Des. Codes Cryptogr. 88(1): 119-131 (2020) - [j12]Yanxun Chang, Simone Costa, Tao Feng
Strong difference families of special types. Discret. Math. 343(4): 111776 (2020)
2010 – 2019
- 2019
- [j11]Tao Feng
Optimal 2-D (n × m , 3 , 2 , 1)-optical orthogonal codes and related equi-difference conflict avoiding codes. Des. Codes Cryptogr. 87(7): 1499-1520 (2019) - 2018
- [j10]Jing Zhang, Xiaomiao Wang, Tao Wang:
Tricyclic balanced sampling plans avoiding adjacent units with block size three. Ars Comb. 141: 319-332 (2018) - [j9]Simone Costa, Tao Feng
Frame difference families and resolvable balanced incomplete block designs. Des. Codes Cryptogr. 86(12): 2725-2745 (2018) - [j8]Simone Costa
New 2-designs from strong difference families. Finite Fields Their Appl. 50: 391-405 (2018) - [j7]Ping Chen, Xiaomiao Wang
The 3-Way Intersection Problem for Kite Systems. Graphs Comb. 34(6): 1741-1749 (2018) - 2015
- [j6]Tao Feng
Semi-cyclic holey group divisible designs with block size three. Des. Codes Cryptogr. 74(2): 301-324 (2015) - [j5]Xiaomiao Wang
Two-dimensional balanced sampling plans avoiding adjacent units. Discret. Math. 338(9): 1624-1642 (2015) - 2013
- [j4]Xiaomiao Wang
Optimal 2-D (n×m, 3, 2, 1)-optical Orthogonal Codes. IEEE Trans. Inf. Theory 59(1): 710-725 (2013) - 2012
- [j3]Xiaomiao Wang
Further results on optimal (v, 4, 2, 1)-OOCs. Discret. Math. 312(2): 331-340 (2012) - 2011
- [j2]Xiaomiao Wang
Existence of cyclic (3, λ)-GDD of type gv having prescribed number of short orbits. Discret. Math. 311(8-9): 663-675 (2011) - 2010
- [j1]Xiaomiao Wang
Further results on (v, 4, 1)-perfect difference families. Discret. Math. 310(13-14): 1995-2006 (2010)
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-10-16 21:27 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: