default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid A. Karpuk
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]David A. Karpuk
, Razane Tajeddine:
Modular Polynomial Codes for Secure and Robust Distributed Matrix Multiplication. IEEE Trans. Inf. Theory 70(6): 4396-4413 (2024)- [c22]Ryann Cartor, Rafael G. L. D'Oliveira, Salim El Rouayheb, Daniel Heinlein, David A. Karpuk, Alex Sprintson:
Secure Distributed Matrix Multiplication with Precomputation. ISIT 2024: 2568-2573 - [c21]Okko Makkonen, David A. Karpuk, Camilla Hollanti:
Algebraic Geometry Codes for Cross-Subspace Alignment in Private Information Retrieval. ISIT 2024: 2874-2879 - [i37]Ryann Cartor, Rafael G. L. D'Oliveira, Salim El Rouayheb, Daniel Heinlein, David A. Karpuk, Alex Sprintson:
Secure Distributed Matrix Multiplication with Precomputation. CoRR abs/2405.06121 (2024) - [i36]Okko Makkonen, David A. Karpuk, Camilla Hollanti:
Algebraic Geometry Codes for Cross-Subspace Alignment in Private Information Retrieval. CoRR abs/2405.18052 (2024) - [i35]Okko Makkonen, David A. Karpuk, Camilla Hollanti:
Secret Sharing for Secure and Private Information Retrieval: A Construction Using Algebraic Geometry Codes. CoRR abs/2408.00542 (2024) - 2023
- [i34]David A. Karpuk, Razane Tajeddine:
Modular Polynomial Codes for Secure and Robust Distributed Matrix Multiplication. CoRR abs/2305.03465 (2023) - 2021
- [j14]Rafael G. L. D'Oliveira, Salim El Rouayheb, Daniel Heinlein, David A. Karpuk:
Degree Tables for Secure Distributed Matrix Multiplication. IEEE J. Sel. Areas Inf. Theory 2(3): 907-918 (2021) - [j13]Tristram Bogart, Anna-Lena Horlemann-Trautmann, David A. Karpuk, Alessandro Neri, Mauricio Velasco:
Constructing Partial MDS Codes from Reducible Algebraic Curves. SIAM J. Discret. Math. 35(4): 2946-2970 (2021) - [j12]Mohamed Taoufiq Damir, Alex Karrila, Laia Amorós, Oliver W. Gnilke, David A. Karpuk, Camilla Hollanti:
Well-Rounded Lattices: Towards Optimal Coset Codes for Gaussian and Fading Wiretap Channels. IEEE Trans. Inf. Theory 67(6): 3645-3663 (2021) - [i33]Rafael G. L. D'Oliveira, Salim El Rouayheb, Daniel Heinlein, David A. Karpuk:
Degree Tables for Secure Distributed Matrix Multiplication. CoRR abs/2106.09816 (2021) - 2020
- [j11]Jie Li, David A. Karpuk, Camilla Hollanti:
Towards Practical Private Information Retrieval From MDS Array Codes. IEEE Trans. Commun. 68(6): 3415-3425 (2020) - [j10]Netanel Raviv, David A. Karpuk:
Private Polynomial Computation From Lagrange Encoding. IEEE Trans. Inf. Forensics Secur. 15: 553-563 (2020) - [j9]Rafael G. L. D'Oliveira, Salim El Rouayheb, David A. Karpuk:
GASP Codes for Secure Distributed Matrix Multiplication. IEEE Trans. Inf. Theory 66(7): 4038-4050 (2020) - [c20]Rafael G. L. D'Oliveira, Salim El Rouayheb, Daniel Heinlein, David A. Karpuk:
Notes on Communication and Computation in Secure Distributed Matrix Multiplication. CNS 2020: 1-6 - [i32]Rafael G. L. D'Oliveira, Salim El Rouayheb, Daniel Heinlein, David A. Karpuk:
Notes on Communication and Computation in Secure Distributed Matrix Multiplication. CoRR abs/2001.05568 (2020) - [i31]Tristram Bogart, Anna-Lena Horlemann-Trautmann, David A. Karpuk, Alessandro Neri, Mauricio Velasco:
Constructing Partial MDS Codes from Reducible Curves. CoRR abs/2007.14829 (2020)
2010 – 2019
- 2019
- [j8]Ragnar Freij-Hollanti, Oliver W. Gnilke, Camilla Hollanti, Anna-Lena Horlemann-Trautmann, David A. Karpuk, Ivo Kubjas:
$t$ -Private Information Retrieval Schemes Using Transitive Codes. IEEE Trans. Inf. Theory 65(4): 2107-2118 (2019) - [j7]Razane Tajeddine, Oliver W. Gnilke, David A. Karpuk, Ragnar Freij-Hollanti, Camilla Hollanti:
Private Information Retrieval From Coded Storage Systems With Colluding, Byzantine, and Unresponsive Servers. IEEE Trans. Inf. Theory 65(6): 3898-3906 (2019) - [c19]Rafael G. L. D'Oliveira, Salim El Rouayheb, David A. Karpuk:
GASP Codes for Secure Distributed Matrix Multiplication. ISIT 2019: 1107-1111 - [c18]Netanel Raviv, David A. Karpuk:
Private Polynomial Computation from Lagrange Encoding. ISIT 2019: 1672-1676 - [c17]Tuvi Etzion, Oliver W. Gnilke, David A. Karpuk, Eitan Yaakobi, Yiwei Zhang:
Private Proximity Retrieval. ISIT 2019: 2119-2123 - [c16]Rafael G. L. D'Oliveira, Salim El Rouayheb, Daniel Heinlein, David A. Karpuk:
Degree Tables for Secure Distributed Matrix Multiplication. ITW 2019: 1-5 - [i30]Jie Li, David A. Karpuk, Camilla Hollanti:
Private Information Retrieval from MDS Array Codes with (Near-) Optimal Repair Bandwidth. CoRR abs/1909.10289 (2019) - 2018
- [c15]David A. Karpuk:
Private Computation of Systematically Encoded Data with Colluding Servers. ISIT 2018: 2112-2116 - [c14]Razan Tajeddine, Oliver W. Gnilke, David A. Karpuk, Ragnar Freij-Hollanti, Camilla Hollanti:
Robust Private Information Retrieval from Coded Systems with Byzantine and Colluding Servers. ISIT 2018: 2451-2455 - [i29]David A. Karpuk:
Private Computation of Systematically Encoded Data with Colluding Servers. CoRR abs/1801.02194 (2018) - [i28]Razan Tajeddine, Oliver W. Gnilke, David A. Karpuk, Ragnar Freij-Hollanti, Camilla Hollanti:
Robust Private Information Retrieval from Coded Systems with Byzantine and Colluding Servers. CoRR abs/1802.03731 (2018) - [i27]Razan Tajeddine, Oliver W. Gnilke, David A. Karpuk, Ragnar Freij-Hollanti, Camilla Hollanti:
Private Information Retrieval from Coded Storage Systems with Colluding, Byzantine, and Unresponsive Servers. CoRR abs/1806.08006 (2018) - [i26]Netanel Raviv, David A. Karpuk:
Private Polynomial Computation from Lagrange Encoding. CoRR abs/1812.04142 (2018) - [i25]Rafael G. L. D'Oliveira, Salim El Rouayheb, David A. Karpuk:
GASP Codes for Secure Distributed Matrix Multiplication. CoRR abs/1812.09962 (2018) - 2017
- [j6]Ragnar Freij-Hollanti, Oliver W. Gnilke, Camilla Hollanti, David A. Karpuk:
Private Information Retrieval from Coded Databases with Colluding Servers. SIAM J. Appl. Algebra Geom. 1(1): 647-664 (2017) - [j5]David A. Karpuk, Peter Moss:
Channel Pre-Inversion and Max-SINR Vector Perturbation for Large-Scale Broadcast Channels. IEEE Trans. Broadcast. 63(3): 494-506 (2017) - [c13]Razan Tajeddine, Oliver W. Gnilke, David A. Karpuk, Ragnar Freij-Hollanti, Camilla Hollanti, Salim El Rouayheb:
Private information retrieval schemes for codec data with arbitrary collusion patterns. ISIT 2017: 1908-1912 - [c12]Alex Karrila, Niko R. Väisänen, David A. Karpuk, Camilla Hollanti:
Lattice coding for Rician fading channels from Hadamard rotations. ISIT 2017: 3110-3114 - [i24]Alex Karrila, Niko R. Väisänen, David A. Karpuk, Camilla Hollanti:
Lattice coding for Rician fading channels from Hadamard rotations. CoRR abs/1701.07605 (2017) - [i23]Razan Tajeddine, Oliver W. Gnilke, David A. Karpuk, Ragnar Freij-Hollanti, Camilla Hollanti, Salim El Rouayheb:
Private Information Retrieval Schemes for Coded Data with Arbitrary Collusion Patterns. CoRR abs/1701.07636 (2017) - [i22]Ragnar Freij-Hollanti, Oliver W. Gnilke, Camilla Hollanti, Anna-Lena Horlemann-Trautmann, David A. Karpuk, Ivo Kubjas:
t-Private Information Retrieval Schemes Using Transitive Codes. CoRR abs/1712.02850 (2017) - 2016
- [j4]Hsiao-feng Francis Lu, Amaro Barreal, David A. Karpuk, Camilla Hollanti:
Efficiently sphere-decodable physical layer transmission schemes for wireless storage networks. EURASIP J. Adv. Signal Process. 2016: 56 (2016) - [j3]David A. Karpuk, Arsenia Chorti:
Perfect Secrecy in Physical-Layer Network Coding Systems From Structured Interference. IEEE Trans. Inf. Forensics Secur. 11(8): 1875-1887 (2016) - [j2]David A. Karpuk, Camilla Hollanti:
Locally Diverse Constellations From the Special Orthogonal Group. IEEE Trans. Wirel. Commun. 15(6): 4426-4437 (2016) - [c11]Amaro Barreal, Alex Karrila, David A. Karpuk, Camilla Hollanti:
Information bounds and flatness factor approximation for fading wiretap MIMO channels. ITNAC 2016: 277-282 - [c10]Oliver W. Gnilke, Amaro Barreal, Alex Karrila, Ha Thanh Nguyen Tran, David A. Karpuk, Camilla Hollanti:
Well-rounded lattices for coset coding in MIMO wiretap channels. ITNAC 2016: 289-294 - [i21]Amaro Barreal, David A. Karpuk, Camilla Hollanti:
Decoding in Compute-and-Forward Relaying: Real Lattices and the Flatness of Lattice Sums. CoRR abs/1601.05596 (2016) - [i20]David A. Karpuk, Peter Moss:
Large-Scale Channel Inversion and Transmit Vector Perturbation. CoRR abs/1601.08112 (2016) - [i19]David A. Karpuk, Amaro Barreal, Oliver W. Gnilke, Camilla Hollanti:
Nested Lattice Codes for Vector Perturbation Systems. CoRR abs/1604.07048 (2016) - [i18]Alex Karrila, Amaro Barreal, David A. Karpuk, Camilla Hollanti:
Information Bounds and Flatness Factor Approximation for Fading Wiretap Channels. CoRR abs/1606.06099 (2016) - [i17]Oliver W. Gnilke, Amaro Barreal, Alex Karrila, Ha Thanh Nguyen Tran, David A. Karpuk, Camilla Hollanti:
Well-Rounded Lattices for Coset Coding in MIMO Wiretap Channels. CoRR abs/1609.07666 (2016) - [i16]Alex Karrila, David A. Karpuk, Camilla Hollanti:
On Analytical and Geometric Lattice Design Criteria for Wiretap Coset Codes. CoRR abs/1609.07723 (2016) - [i15]Ragnar Freij-Hollanti, Oliver W. Gnilke, Camilla Hollanti, David A. Karpuk:
Private Information Retrieval from Coded Databases with Colluding Servers. CoRR abs/1611.02062 (2016) - 2015
- [j1]David A. Karpuk, Anne-Maria Ernvall-Hytönen, Camilla Hollanti, Emanuele Viterbo:
Probability estimates for fading and wiretap channels from ideal class zeta functions. Adv. Math. Commun. 9(4): 391-413 (2015) - [c9]David A. Karpuk, Peter Moss:
Hybrid channel pre-inversion and interference alignment strategies. ICC Workshops 2015: 2245-2250 - [c8]Amaro Barreal, Joonas Pääkkönen, David A. Karpuk, Camilla Hollanti, Olav Tirkkonen:
A low-complexity message recovery method for Compute-and-Forward relaying. ITW Fall 2015: 39-43 - [i14]Amaro Barreal, Camilla Hollanti, David A. Karpuk:
Reduced Complexity Decoding of n x n Algebraic Space-Time Codes. CoRR abs/1501.06686 (2015) - [i13]Arsenia Chorti, Ragnar Freij, David A. Karpuk:
Degrees of Freedom and Secrecy in Wireless Relay Networks. CoRR abs/1502.06007 (2015) - [i12]Amaro Barreal, Joonas Pääkkönen, David A. Karpuk, Camilla Hollanti, Olav Tirkkonen:
A Low-Complexity Message Recovery Method for Compute-and-Forward Relaying. CoRR abs/1504.03182 (2015) - [i11]David A. Karpuk, Camilla Hollanti:
Locally Diverse Constellations from the Special Orthogonal Group. CoRR abs/1505.02903 (2015) - [i10]David A. Karpuk, Arsenia Chorti:
Strong Secrecy in Wireless Network Coding Systems from Structured Interference. CoRR abs/1507.01098 (2015) - 2014
- [c7]David A. Karpuk, Camilla Hollanti:
Rotating non-uniform and high-dimensional constellations using geodesic flow on lie groups. ICC 2014: 5884-5889 - [c6]Arsenia Chorti, Mehdi M. Molu, David A. Karpuk, Camilla Hollanti, Alister G. Burr:
Strong secrecy in wireless network coding systems with M-QAM modulators. ICCC 2014: 181-186 - [c5]David A. Karpuk, Camilla Hollanti, Amaro Barreal:
Node repair for distributed storage systems over fading channels. ISITA 2014: 383-387 - [c4]Camilla Hollanti, Hsiao-feng Lu, David A. Karpuk, Amaro Barreal:
New relay-based transmission protocols for wireless distributed storage systems. ISITA 2014: 585-589 - [c3]David A. Karpuk, Camilla Hollanti:
Multi-dimensional and non-uniform constellation optimization via the special orthogonal group. ITW 2014: 287-291 - [c2]Camilla Hollanti, David A. Karpuk, Amaro Barreal, Hsiao-feng Francis Lu:
Space-time storage codes for wireless distributed storage systems. VITAE 2014: 1-5 - [i9]Camilla Hollanti, David A. Karpuk, Amaro Barreal, Hsiao-feng Francis Lu:
Space-Time Storage Codes for Wireless Distributed Storage Systems. CoRR abs/1404.6645 (2014) - [i8]Amaro Barreal, Camilla Hollanti, David A. Karpuk, Hsiao-feng Lu:
Algebraic Codes and a New Physical Layer Transmission Protocol for Wireless Distributed Storage Systems. CoRR abs/1405.4375 (2014) - [i7]Arsenia Chorti, Mehdi M. Molu, David A. Karpuk, Camilla Hollanti, Alister G. Burr:
Strong Secrecy in Wireless Network Coding Systems with M-QAM Modulators. CoRR abs/1407.0915 (2014) - [i6]David A. Karpuk, Peter Moss:
Hybrid Channel Pre-Inversion and Interference Alignment Strategies. CoRR abs/1409.7222 (2014) - [i5]David A. Karpuk, Camilla Hollanti:
Multi-Dimensional and Non-Uniform Constellation Optimization via the Special Orthogonal Group. CoRR abs/1409.7244 (2014) - [i4]David A. Karpuk, Camilla Hollanti, Amaro Barreal:
Node Repair for Distributed Storage Systems over Fading Channels. CoRR abs/1409.7247 (2014) - [i3]David A. Karpuk, Anne-Maria Ernvall-Hytönen, Camilla Hollanti, Emanuele Viterbo:
Probability Estimates for Fading and Wiretap Channels from Ideal Class Zeta Functions. CoRR abs/1412.6946 (2014) - 2013
- [c1]David A. Karpuk, Iván Blanco-Chacón, Camilla Hollanti:
Probability bounds for an eavesdropper's correct decision over a MIMO wiretap channel. ISIT 2013: 2014-2018 - [i2]Camilla Hollanti, Emanuele Viterbo, David A. Karpuk:
Nonasymptotic Probability Bounds for Fading Channels Exploiting Dedekind Zeta Functions. CoRR abs/1303.3475 (2013) - [i1]David A. Karpuk, Camilla Hollanti:
Rotating Non-Uniform and High-Dimensional Constellations Using Geodesic Flow on Lie Groups. CoRR abs/1309.5247 (2013)
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-12 22:59 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:
