default search action
Mayur Punekar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [c8]Mayur Punekar, Qutaibah M. Malluhi, Yongge Wang
, Yvo Desmedt:
Candidate MDS Array Codes for Tolerating Three Disk Failures in RAID-7 Architectures. BDCAT 2017: 33-42 - [c7]Mayur Punekar, Qutaibah M. Malluhi, Yvo Desmedt, Yongge Wang
Computational Aspects of Ideal (t, n)-Threshold Scheme of Chen, Laing, and Martin. CANS 2017: 470-481 - 2016
- [i5]Mayur Punekar, Joseph Jean Boutros:
Diversity of Low-Density Lattices. CoRR abs/1605.04128 (2016) - 2015
- [c6]Mayur Punekar, Joseph Jean Boutros:
Diversity of low-density lattices. ICT 2015: 277-282 - [c5]Mayur Punekar, Joseph Jean Boutros, Ezio Biglieri:
A Poltyrev outage limit for lattices. ISIT 2015: 456-460 - 2013
- [j2]Mayur Punekar, Pascal O. Vontobel
Low-Complexity LP Decoding of Nonbinary Linear Codes. IEEE Trans. Commun. 61(8): 3073-3085 (2013) - 2012
- [i4]Mayur Punekar, Pascal O. Vontobel, Mark F. Flanagan:
Low-Complexity LP Decoding of Nonbinary Linear Codes. CoRR abs/1211.5757 (2012) - 2011
- [c4]Mayur Punekar, Mark F. Flanagan
Trellis-based check node processing for low-complexity nonbinary LP decoding. ISIT 2011: 1653-1657 - [i3]Mayur Punekar, Mark F. Flanagan:
Trellis-Based Check Node Processing for Low-Complexity Nonbinary LP Decoding. CoRR abs/1102.3390 (2011) - 2010
- [j1]Akin Tanatmis, Stefan Ruzika, Horst W. Hamacher, Mayur Punekar, Frank Kienle, Norbert Wehn
A separation algorithm for improved LP-decoding of linear block codes. IEEE Trans. Inf. Theory 56(7): 3277-3289 (2010) - [c3]Mayur Punekar, Mark F. Flanagan
Low complexity Linear Programming decoding of nonbinary linear codes. Allerton 2010: 6-13 - [c2]Akin Tanatmis, Stefan Ruzika, Mayur Punekar, Frank Kienle:
Numerical Comparison of IP Formulations as ML Decoders. ICC 2010: 1-5 - [i2]Mayur Punekar, Mark F. Flanagan:
Low Complexity Linear Programming Decoding of Nonbinary Linear Codes. CoRR abs/1007.1368 (2010)
2000 – 2009
- 2009
- [c1]Stefan Ruzika, Akin Tanatmis, Frank Kienle, Horst W. Hamacher, Norbert Wehn
Valid inequalities for binary linear codes. ISIT 2009: 2216-2220 - 2008
- [i1]Akin Tanatmis, Stefan Ruzika, Horst W. Hamacher, Mayur Punekar, Frank Kienle, Norbert Wehn:
A Separation Algorithm for Improved LP-Decoding of Linear Block Codes. CoRR abs/0812.2559 (2008)
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-08-05 20:23 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: