default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 431 matches
- 2024
- Haiyang Liu, Xiaopeng Jiao, Lianrong Ma:
An Investigation on LP Decoding of Short Binary Linear Codes With the Subgradient Method. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 107(8): 1395-1399 (2024) - Jong Yoon Hyun, Jihye Jeong, Yoonjin Lee:
Infinite Families of Few Weight Optimal Binary Linear Codes From Multivariable Functions. IEEE Trans. Inf. Theory 70(10): 6912-6931 (2024) - Shitao Li, Minjia Shi:
Characterization and Classification of Binary Linear Codes With Various Hull Dimensions From an Improved Mass Formula. IEEE Trans. Inf. Theory 70(5): 3357-3372 (2024) - Uri Erez, Or Ordentlich, Shlomo Shamai:
Lower Bounds on Mutual Information for Linear Codes Transmitted over Binary Input Channels, and for Information Combining. ISIT 2024: 3386-3391 - Junming Ke, Henk D. L. Hollmann, Ago-Erik Riet:
A Binary Linear Functional-Repair Regenerating Code on 72 Coding Spaces Related to PG(2, 8). ISIT 2024: 2335-2340 - Uri Erez, Or Ordentlich, Shlomo Shamai:
Lower Bounds on Mutual Information for Linear Codes Transmitted over Binary Input Channels, and for Information Combining. CoRR abs/2401.14710 (2024) - Fatma Altunbulak Aksu, Roghayeh Hafezieh, Ipek Tuvay:
Binary linear codes with a fixed point free permutation automorphism of order three. CoRR abs/2402.10667 (2024) - Wajid M. Shaikh, Rupali S. Jain, B. Surendranath Reddy, Bhagyashri S. Patil:
Construction of Minimal Binary Linear Codes of dimension n+3. CoRR abs/2403.13350 (2024) - Omar Alrabiah, Venkatesan Guruswami:
Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles. CoRR abs/2404.05864 (2024) - Omar Alrabiah, Venkatesan Guruswami:
Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- Jon-Lark Kim:
Binary optimal linear codes with various hull dimensions and entanglement-assisted QECCs. Comput. Appl. Math. 42(3) (2023) - Whan-Hyuk Choi, Cem Güneri, Jon-Lark Kim, Ferruh Özbudak:
Optimal Binary Linear Complementary Pairs of Codes. Cryptogr. Commun. 15(2): 469-486 (2023) - Sihem Mesnager, Liqin Qian, Xiwang Cao:
Further projective binary linear codes derived from two-to-one functions and their duals. Des. Codes Cryptogr. 91(3): 719-746 (2023) - Jianying Fang, Yuhua Sun, Lan Wang, Qiang Wang:
Two-weight or three-weight binary linear codes from cyclotomic mappings. Finite Fields Their Appl. 85: 102114 (2023) - Lingjun Kong, Haiyang Liu, Lianrong Ma:
More on Incorrigible Sets of Binary Linear Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 106(5): 863-867 (2023) - Hao Wu, Xiaoni Du, Xingbin Qiao:
Construction of Two Classes of Minimal Binary Linear Codes from Definition Sets. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 106(12): 1470-1474 (2023) - Cem Güneri:
Optimal Binary Linear Complementary Pairs From Solomon-Stiffler Codes. IEEE Trans. Inf. Theory 69(10): 6512-6517 (2023) - Yanjun Li, Jie Peng, Haibin Kan, Lijing Zheng:
Minimal Binary Linear Codes From Vectorial Boolean Functions. IEEE Trans. Inf. Theory 69(5): 2955-2968 (2023) - Elyassaf Loyfer, Nati Linial:
New LP-Based Upper Bounds in the Rate-Vs.-Distance Problem for Binary Linear Codes. IEEE Trans. Inf. Theory 69(5): 2886-2899 (2023) - Sihem Mesnager, Liqin Qian, Xiwang Cao, Mu Yuan:
Several Families of Binary Minimal Linear Codes From Two-to-One Functions. IEEE Trans. Inf. Theory 69(5): 3285-3301 (2023) - Claude Carlet, Luca Mariot, Luca Manzoni, Stjepan Picek:
Evolutionary Strategies for the Design of Binary Linear Codes. EvoCOP 2023: 114-129 - Abdullah Murad, Wai Ho Mow:
Some New Constructions of AFER-Optimal Binary Linear Block Codes. ISIT 2023: 1261-1265 - V Arvind Rameshwar, Navin Kashyap:
Counting Constrained Codewords in Binary Linear Codes via Fourier Expansions. ISIT 2023: 2667-2672 - Alex Samorodnitsky:
On the difficulty to beat the first linear programming bound for binary codes. CoRR abs/2308.16038 (2023) - Hao Chen, Zhiqiang Chen, Yanfeng Qi:
Construction and Fast Decoding of Binary Linear Sum-Rank-Metric Codes. CoRR abs/2311.03619 (2023) - Shitao Li, Minjia Shi, San Ling:
An open problem and a conjecture on binary linear complementary pairs of codes. CoRR abs/2312.09482 (2023) - 2022
- Yansheng Wu, Jong Yoon Hyun, Qin Yue:
Optimal binary linear codes from posets of the disjoint union of two chains. Adv. Math. Commun. 16(4): 1051-1058 (2022) - Ignacio García-Marco, Irene Márquez-Corbella, Edgar Martínez-Moro, Yuriko Pitones:
Computing generalized hamming weights of binary linear codes via free resolutions. ACM Commun. Comput. Algebra 56(2): 19-24 (2022) - Yan Wang, Xilin Han, Weiqiong Wang, Ziling Heng:
Linear complexity over ${\mathbb {F}_{{q}}}$ and 2-adic complexity of a class of binary generalized cyclotomic sequences with good autocorrelation. Des. Codes Cryptogr. 90(8): 1695-1712 (2022) - Fengrong Zhang, Enes Pasalic, René Rodríguez, Yongzhuang Wei:
Minimal binary linear codes: a general framework based on bent concatenation. Des. Codes Cryptogr. 90(5): 1289-1318 (2022)
skipping 401 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-10-19 17:07 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint