NSTL国家科技图书文献中心

1. Maximal-Capacity Discrete Memoryless Channel Identification NSTL国家科技图书文献中心

Maximilian Egger | Rawad Bitar ... - 《IEEE Transactions on Information Theory》 - 2025,71(2) - 1248～1265 - 共18页

摘要：The problem of identifying the channel with the highest capacity among several discrete memoryless channels (DMCs) is considered. The problem is cast as a pure-exploration multi-armed bandit problem, ...

关键词： Channel estimation | Complexity theory | Training | Symbols | Capacity planning | Transmitters | Standards | Receivers | Picture archiving and communication systems | Lower bound

2. Function-Correcting Codes NSTL国家科技图书文献中心

Andreas Lenz | Rawad Bitar ... - 《IEEE Transactions on Information Theory》 - 2023,69(9) - 5604～5618 - 共15页

摘要：In this paper we study function-correcting codes, a new class of codes designed to protect the function evaluation of a message against errors. We show that FCCs are equivalent to irregular-distance c...

关键词： Error correction codes | Redundancy | Receivers | Termination of employment | Hamming weight | FCC | Noise measurement

3. Efficient Distributed Machine Learning via Combinatorial Multi-Armed Bandits NSTL国家科技图书文献中心

Maximilian Egger | Rawad Bitar ... - 《2022 IEEE International Symposium on Information Theory: ISIT 2022, Espoo, Finland, 26 June - 1 July 2022, [v.1]》 - IEEE International Symposium on Information Theory - 2022, - 1653～1658 - 共6页

摘要：We consider the distributed stochastic gradient descent problem, where a main node distributes gradient calculations among n workers from which at most b ≤ n can be utilized in parallel. By assigning ...

关键词： Runtime | Costs | Computational modeling | Simulation | Stochastic processes | Machine learning | Time factors

4. Secure Private and Adaptive Matrix Multiplication Beyond the Singleton Bound EI 工程索引 NSTL国家科技图书文献中心

Christoph Hofmeister | Rawad Bitar ... - 《IEEE Journal on Selected Areas in Information Theory》 - 2022,3(2) - 275～285 - 共11页

摘要：We consider the problem of designing secure and private codes for distributed matrix-matrix multiplication. A master server owns two private matrices and hires worker nodes to help compute their produ...

关键词： Privacy | Codes | Encoding | Time factors | Computational complexity | Clustering algorithms | Random variables

5. Distributed Matrix-Vector Multiplication with Sparsity and Privacy Guarantees NSTL国家科技图书文献中心

Marvin Xhemrishi | Rawad Bitar ... - 《2022 IEEE International Symposium on Information Theory: ISIT 2022, Espoo, Finland, 26 June - 1 July 2022, [v.1]》 - IEEE International Symposium on Information Theory - 2022, - 1028～1033 - 共6页

摘要：We consider the problem of designing a coding scheme that allows both sparsity and privacy for distributed matrix-vector multiplication. Perfect information-theoretic privacy requires encoding the inp...

关键词： Privacy | Encoding | Delays | Sparse matrices | Task analysis

6. Adaptive Private Distributed Matrix Multiplication NSTL国家科技图书文献中心

Rawad Bitar | Marvin Xhemrishi ... - 《IEEE Transactions on Information Theory》 - 2022,68(4) - 2653～2673 - 共21页

摘要：We consider the problem of designing codes with flexible rate (referred to as rateless codes), for private distributed matrix-matrix multiplication. A master server owns two private matrices $mathbf ...

关键词： Task analysis | Codes | Privacy | Encoding | Data privacy | Computational modeling | Servers

7. Multiple Criss-Cross Insertion and Deletion Correcting Codes NSTL国家科技图书文献中心

Lorenz Welter | Rawad Bitar ... - 《IEEE Transactions on Information Theory》 - 2022,68(6) - 3767～3779 - 共13页

摘要：This paper investigates the problem of correcting multiple criss-cross insertions and deletions in arrays. More precisely, we study the unique recovery of $n times n$ arrays affected by ${t}$ -cris...

关键词： Codes | Redundancy | Europe | Encoding | Codecs | Terminology | Systematics

8. Information Theoretic Private Inference in Quantized Models NSTL国家科技图书文献中心

Netanel Raviv | Rawad Bitar ... - 《2022 IEEE International Symposium on Information Theory: ISIT 2022, Espoo, Finland, 26 June - 1 July 2022, [v.1]》 - IEEE International Symposium on Information Theory - 2022, - 1641～1646 - 共6页

摘要：In a Private Inference scenario, a server holds a model (e.g., a neural network), a user holds data, and the user wishes to apply the model on her data. The privacy of both parties must be protected; ...

关键词： Privacy | Protocols | Computational modeling | Neural networks | Machine learning | Information retrieval | Data models

9. Equivalence of Insertion/Deletion Correcting Codes for d-dimensional Arrays NSTL国家科技图书文献中心

Evagoras Stylianou | Lorenz Welter ... - 《2022 IEEE International Symposium on Information Theory: ISIT 2022, Espoo, Finland, 26 June - 1 July 2022, [v.1]》 - IEEE International Symposium on Information Theory - 2022, - 814～819 - 共6页

摘要：We consider the problem of correcting insertion and deletion errors in the d-dimensional space. This problem is well understood for vectors (one-dimensional space) and was recently studied for arrays ...

关键词： Codes | Redundancy

10. Detecting Deletions and Insertions in Concatenated Strings with Optimal Redundancy NSTL国家科技图书文献中心

Serge Kas Hanna | Rawad Bitar - 《2021 IEEE International Symposium on Information Theory: IEEE International Symposium on Information Theory (ISIT), 12-20 July 2021, Virtual Conference, Melbourne, Australia》 - IEEE International Symposium on Information Theory - 2021, - 1985～1990 - 共6页

摘要：We study codes that can detect the exact number of deletions and insertions in concatenated binary strings. We construct optimal codes for the case of detecting up to Redundancy | Information theory

NSTL主题词： Insertion Mutation | Cosmic strings | redundancy | deletions | Optimal

文献传递获取全文

文献传递

摘要：The problem of identifying the channel with the highest capacity among several discrete memoryless channels (DMCs) is considered. The problem is cast as a pure-exploration multi-armed bandit problem, ...

关键词： Channel estimation | Complexity theory | Training | Symbols | Capacity planning | Transmitters | Standards | Receivers | Picture archiving and communication systems | Lower bound

摘要：In this paper we study function-correcting codes, a new class of codes designed to protect the function evaluation of a message against errors. We show that FCCs are equivalent to irregular-distance c...

关键词： Error correction codes | Redundancy | Receivers | Termination of employment | Hamming weight | FCC | Noise measurement

摘要：We consider the distributed stochastic gradient descent problem, where a main node distributes gradient calculations among n workers from which at most b ≤ n can be utilized in parallel. By assigning ...

关键词： Runtime | Costs | Computational modeling | Simulation | Stochastic processes | Machine learning | Time factors

摘要：We consider the problem of designing secure and private codes for distributed matrix-matrix multiplication. A master server owns two private matrices and hires worker nodes to help compute their produ...

关键词： Privacy | Codes | Encoding | Time factors | Computational complexity | Clustering algorithms | Random variables

摘要：We consider the problem of designing a coding scheme that allows both sparsity and privacy for distributed matrix-vector multiplication. Perfect information-theoretic privacy requires encoding the inp...

关键词： Privacy | Encoding | Delays | Sparse matrices | Task analysis

摘要：We consider the problem of designing codes with flexible rate (referred to as rateless codes), for private distributed matrix-matrix multiplication. A master server owns two private matrices $mathbf ...

关键词： Task analysis | Codes | Privacy | Encoding | Data privacy | Computational modeling | Servers

摘要：This paper investigates the problem of correcting multiple criss-cross insertions and deletions in arrays. More precisely, we study the unique recovery of $n times n$ arrays affected by ${t}$ -cris...

关键词： Codes | Redundancy | Europe | Encoding | Codecs | Terminology | Systematics

摘要：In a Private Inference scenario, a server holds a model (e.g., a neural network), a user holds data, and the user wishes to apply the model on her data. The privacy of both parties must be protected; ...

关键词： Privacy | Protocols | Computational modeling | Neural networks | Machine learning | Information retrieval | Data models

摘要：We consider the problem of correcting insertion and deletion errors in the d-dimensional space. This problem is well understood for vectors (one-dimensional space) and was recently studied for arrays ...

关键词： Codes | Redundancy

摘要：We study codes that can detect the exact number of deletions and insertions in concatenated binary strings. We construct optimal codes for the case of detecting up to Redundancy | Information theory

NSTL主题词： Insertion Mutation | Cosmic strings | redundancy | deletions | Optimal

4008-161-200 800-990-8900

国家科技图书文献中心