Polynomial Batch Codes for Efficient IT-PIR

Proceedings on Privacy Enhancing Technologies
doi 10.1515/popets-2016-0036
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Walter de Gruyter GmbH

Related search

Efficient Complex Operators for Irregular Codes

2011English

Efficient Batch Zero-Knowledge Arguments for Low Degree Polynomials

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Efficient Decoding Technique for Block Product Turbo Codes

International Journal of Multimedia and Ubiquitous Engineering
Computer Science
2016English

Efficient Dc-Free RLL Codes for Optical Recording

IEEE Transactions on Communications
Electronic EngineeringElectrical
2003English

Efficient Evaluation of Polynomial Forms

Journal of Computer and System Sciences
Computer NetworksApplied MathematicsCommunicationsComputational TheoryMathematicsTheoretical Computer Science
1972English

Efficient Log Likelihood Ratio Estimation for Polar Codes

English

An Efficient Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence

Journal of Combinatorial Optimization
ControlOptimizationCombinatoricsApplied MathematicsDiscrete MathematicsComputer Science ApplicationsMathematicsComputational Theory
2006English

Quasicyclic MDS Codes for Distributed Storage With Efficient Exact Repair

2011English

Efficient Soft Decoding of Raptor Codes for Satellite Broadcasting System

2015English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy