Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Upper and Lower Bounds for Continuous Non-Malleable Codes

Dana Dachman-Soled, Mukul Kulkarni

Published Jan 1, 2019• 11 citations
Publisher
DOI
10.1007/978-3-030-17253-4_18

Related papers

Continuously Non-Malleable Codes in the Split-State Model from Minimal Assumptions

Rafail Ostrovsky, Giuseppe Persiano, Daniele Venturi +1 more

Lecture notes in computer science•Jan 1, 2018•29 citations

Information Theoretic Continuously Non-Malleable Codes in the Constant Split-State Model.

Nico Döttling, Jesper Buus Nielsen, Maciej Obremski

Electronic colloquium on computational complexity•Jan 1, 2017•4 citations

Interactive Non-malleable Codes

Nils Fleischhacker, Vipul Goyal, Abhishek Jain +2 more

Lecture notes in computer science•Jan 1, 2019•4 citations

The Correcting Capacities of Linear Codes

M. V. Kozlov

Soviet physics. Doklady•Nov 1, 1969•3 citations

Tight Lower and Upper Bounds on the Minimum Distance of LDPC Codes

Yoones Hashemi, Amir H. Banihashemi

In this letter, we obtain lower and upper bounds on the minimum distance dminof low-density parity-check (LDPC) codes. The bounds are derived by categorizing the non-zero code words of an LDPC code into two categories of elementary and non-elementary. The first category contains code words whose induced subgraph has only degree-2 check nodes. We propose an efficient search algorithm that can find the elementary code words of an LDPC code with weight less than a certain value amax, exhaustively. We also derive a lower bound Lneon the weight of non-elementary code words. By performing the search with amax= Lne, we either obtain an elementary code word with the smallest weight dmin, or establish the lower bound of Lneon dmin. For the upper bound, we modify our search algorithm to reach elementary codewords of larger weights at the cost of being non-exhaustive. Once such a codeword is found, its weight acts as an upper bound on dmin. We examine a large number of regular and irregular LDPC codes, and demonstrate the efficiency and versatility of our technique in finding lower and upper bounds on, and in many cases the exact value of, dmin. Finding dmin, or establishing search-based lower or upper bounds, for many of the examined codes are out of the reach of any existing algorithm.

IEEE Communications Letters•Nov 1, 2017•11 citations

Analytical Lower and Upper Bounds for the Threshold Surfaces of Quantum Error Correcting Codes

Ryuji Takagi, Theodore J. Yoder, Isaac L. Chuang

Bulletin of the American Physical Society•Mar 17, 2016•0 citations
In this letter, we obtain lower and upper bounds on the minimum distance dminof low-density parity-check (LDPC) codes. The bounds are derived by categorizing the non-zero code words of an LDPC code into two categories of elementary and non-elementary. The first category contains code words whose induced subgraph has only degree-2 check nodes. We propose an efficient search algorithm that can find the elementary code words of an LDPC code with weight less than a certain value amax, exhaustively. We also derive a lower bound Lneon the weight of non-elementary code words. By performing the search with amax= Lne, we either obtain an elementary code word with the smallest weight dmin, or establish the lower bound of Lneon dmin. For the upper bound, we modify our search algorithm to reach elementary codewords of larger weights at the cost of being non-exhaustive. Once such a codeword is found, its weight acts as an upper bound on dmin. We examine a large number of regular and irregular LDPC codes, and demonstrate the efficiency and versatility of our technique in finding lower and upper bounds on, and in many cases the exact value of, dmin. Finding dmin, or establishing search-based lower or upper bounds, for many of the examined codes are out of the reach of any existing algorithm.