Остановите войну!
for scientists:
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 36 matches
- 2023
- Robert Davis:
State polytopes related to two classes of combinatorial neural codes. Adv. Appl. Math. 142: 102418 (2023) - Huiyang Liu, Pingquan He, Yun Jiang, Qinglin Zhang, Qiaoqiao Xia:
A Simple Check Polytope Projection Penalized Algorithm for ADMM Decoding of LDPC Codes. IEEE Access 11: 2524-2530 (2023) - Mahir Bilen Can, Takayuki Hibi:
Toric Codes from Order Polytopes. Discret. Comput. Geom. 69(3): 834-848 (2023) - 2021
- Giulia Codenotti, Lorenzo Venturello:
Octahedralizing 3-Colorable 3-Polytopes. Discret. Comput. Geom. 66(4): 1429-1445 (2021) - Qiaoqiao Xia, Xin Wang, Huajun Liu, Qinglin Zhang:
A Hybrid Check Polytope Projection Algorithm for ADMM Decoding of LDPC Codes. IEEE Commun. Lett. 25(1): 108-112 (2021) - Mahir Bilen Can, Takayuki Hibi:
Toric Codes from Order Polytopes. CoRR abs/2102.03651 (2021) - 2020
- Yi Wei, Ming-Min Zhao, Min-Jian Zhao, Ming Lei:
A PDD Decoder for Binary Linear Codes With Neural Check Polytope Projection. IEEE Wirel. Commun. Lett. 9(10): 1715-1719 (2020) - Thijs Laarhoven:
Polytopes, Lattices, and Spherical Codes for the Nearest Neighbor Problem. ICALP 2020: 76:1-76:14 - Yi Wei, Ming-Min Zhao, Min-Jian Zhao, Ming Lei:
A PDD Decoder for Binary Linear Codes With Neural Check Polytope Projection. CoRR abs/2006.06240 (2020) - 2019
- Qiaoqiao Xia, Yan Lin, Shidi Tang, Qinglin Zhang:
A Fast Approximate Check Polytope Projection Algorithm for ADMM Decoding of LDPC Codes. IEEE Commun. Lett. 23(9): 1520-1523 (2019) - Yan Lin, Qiaoqiao Xia, Wenwu He, Qinglin Zhang:
A Fast Iterative Check Polytope Projection Algorithm for ADMM Decoding of LDPC Codes by Bisection Method. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(10): 1406-1410 (2019) - Daniel Kane, Shachar Lovett, Sankeerth Rao:
The Independence Number of the Birkhoff Polytope Graph, and Applications to Maximally Recoverable Codes. SIAM J. Comput. 48(4): 1425-1435 (2019) - Jing Bai, Yongchao Wang, Francis C. M. Lau:
Minimum-Polytope-Based Linear Programming Decoder for LDPC Codes via ADMM Approach. IEEE Wirel. Commun. Lett. 8(4): 1032-1035 (2019) - Jing Bai, Yongchao Wang, Francis C. M. Lau:
Minimum-Polytope-Based Linear Programming Decoder for LDPC Codes via ADMM Approach. CoRR abs/1901.07806 (2019) - Thijs Laarhoven:
Polytopes, lattices, and spherical codes for the nearest neighbor problem. CoRR abs/1907.04628 (2019) - 2018
- Haoyuan Wei, Amir H. Banihashemi:
An Iterative Check Polytope Projection Algorithm for ADMM-Based LP Decoding of LDPC Codes. IEEE Commun. Lett. 22(1): 29-32 (2018) - 2017
- Daniel Kane, Shachar Lovett, Sankeerth Rao:
The Independence Number of the Birkhoff Polytope Graph, and Applications to Maximally Recoverable Codes. FOCS 2017: 252-259 - 2015
- Valérie Gauthier-Umaña, Mauricio Velasco:
Dual Toric Codes and Polytopes of Degree One. SIAM J. Discret. Math. 29(1): 683-692 (2015) - 2014
- Oliver Kosut, Lang Tong, David N. C. Tse:
Polytope Codes Against Adversaries in Networks. IEEE Trans. Inf. Theory 60(6): 3308-3344 (2014) - 2013
- Xiaoqing Fan, Aaron B. Wagner, Ebad Ahmed:
Polytope codes for large-alphabet channels. Allerton 2013: 948-955 - Oliver Kosut:
Polytope codes for distributed storage in the presence of an active omniscient adversary. ISIT 2013: 897-901 - 2012
- Rachid Seghir, Vincent Loechner, Benoît Meister:
Integer affine transformations of parametric ℤ-polytopes and applications to loop nest optimization. ACM Trans. Archit. Code Optim. 9(2): 8:1-8:27 (2012) - 2011
- David Burshtein, Idan Goldenberg:
Efficient methods for bounding the fractional distance of LDPC codes and obtaining fundamental polytopes of nonbinary and generalized codes. ISIT 2011: 1263-1267 - Michael Chertkov, Mikhail G. Stepanov:
Polytope of correct (linear programming) decoding and low-weight pseudo-codewords. ISIT 2011: 1648-1652 - Michael Chertkov, Mikhail G. Stepanov:
Polytope of Correct (Linear Programming) Decoding and Low-Weight Pseudo-Codewords. CoRR abs/1102.3902 (2011) - Oliver Kosut, Lang Tong, David Tse:
Polytope Codes Against Adversaries in Networks. CoRR abs/1112.3307 (2011) - 2010
- David L. Donoho, Jared Tanner:
Exponential bounds implying construction of compressed sensing matrices, error-correcting codes, and neighborly polytopes by random sampling. IEEE Trans. Inf. Theory 56(4): 2002-2016 (2010) - Oliver Kosut, Lang Tong, David N. C. Tse:
Polytope codes against adversaries in networks. ISIT 2010: 2423-2427 - 2009
- Thomas Kahle, Walter Wenzel, Nihat Ay:
Hierarchical Models, Marginal Polytopes, and Linear Codes. Kybernetika 45(2): 189-207 (2009) - 2008
- Vitaly Skachek, Mark F. Flanagan, Eimear Byrne, Marcus Greferath:
Polytope representations for linear-programming decoding of non-binary linear codes. ISIT 2008: 1508-1512
skipping 6 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-04-24 03:36 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