Search Results - "random linear code"
-
1
Threshold Rates of Code Ensembles: Linear Is Best
ISSN: 0018-9448, 1557-9654Published: New York IEEE 01.07.2024Published in IEEE transactions on information theory (01.07.2024)“…In this work, we prove new results concerning the combinatorial properties of random linear codes. By applying the thresholds framework from Mosheiff et al…”
Get full text
Journal Article -
2
Distribution of the Minimum Distance of Random Linear Codes
ISSN: 0018-9448, 1557-9654Published: New York IEEE 01.10.2022Published in IEEE transactions on information theory (01.10.2022)“…Let <inline-formula> <tex-math notation="LaTeX">q\geq 2 </tex-math></inline-formula> be a prime power. In this paper, we study the distribution of the minimum…”
Get full text
Journal Article -
3
On the weight distribution of random binary linear codes
ISSN: 1042-9832, 1098-2418Published: New York John Wiley & Sons, Inc 01.01.2020Published in Random structures & algorithms (01.01.2020)“…We investigate the weight distribution of random binary linear codes. For 0 < λ < 1 and n→∞ pick uniformly at random λn vectors in F2n and let C≤F2n be the…”
Get full text
Journal Article -
4
Improved RLCE public key encryption scheme based on Polar codes
ISSN: 2096-109XPublished: POSTS&TELECOM PRESS Co., LTD 01.10.2020Published in 网络与信息安全学报 (01.10.2020)“…For PolarRLCE has no semantic security and be vulnerable to adaptively chosen ciphertext attacks.Based onrandom linear code encryptionscheme,the structure of…”
Get full text
Journal Article -
5
A fast algorithm for matrix embedding steganography
ISSN: 1051-2004, 1095-4333Published: Elsevier Inc 01.02.2014Published in Digital signal processing (01.02.2014)“…A fast algorithm for matrix embedding steganography is proposed in this paper. Matrix embedding encodes the cover image and the secret message with an error…”
Get full text
Journal Article -
6
Cooper: Expedite Batch Data Dissemination in Computer Clusters with Coded Gossips
ISSN: 1045-9219, 1558-2183Published: New York IEEE 01.08.2017Published in IEEE transactions on parallel and distributed systems (01.08.2017)“…Data transfers happen frequently in server clusters for software and application deployment, and in parallel computing clusters to transmit intermediate…”
Get full text
Journal Article -
7
Sparse parity random linear codes for URLLC in channels with memory
ISSN: 2837-178XPublished: IEEE 19.03.2025Published in Annual Conference on Information Sciences and Systems (Online) (19.03.2025)“…The use of short error-correcting codes is vital for achieving an Ultra-Reliable Low Latency Communications capability for supporting the Internet of Things…”
Get full text
Conference Proceeding -
8
Cryptography with Constant Input Locality
ISSN: 0933-2790, 1432-1378Published: New York Springer-Verlag 01.10.2009Published in Journal of cryptology (01.10.2009)“…We study the following natural question: Which cryptographic primitives (if any) can be realized by functions with constant input locality, namely functions in…”
Get full text
Journal Article -
9
Efficient peer-to-peer file sharing using network coding in MANET
ISSN: 1229-2370, 1976-5541Published: Seoul Editorial Department of Journal of Communications and Networks 01.12.2008Published in Journal of communications and networks (01.12.2008)“…Mobile peer-to-peer (P2P) systems have recently got in the limelight of the research community that is striving to build efficient and effective mobile content…”
Get full text
Journal Article -
10
Improved RLCE public key encryption scheme based on Polar codes
ISSN: 2096-109XPublished: POSTS&TELECOM PRESS Co., LTD 01.10.2020Published in 网络与信息安全学报 (01.10.2020)“…For PolarRLCE has no semantic security and be vulnerable to adaptively chosen ciphertext attacks. Based onrandom linear code encryptionscheme, the structure of…”
Get full text
Journal Article -
11
Linear independence of rank 1 matrices and the dimension of -products of codes
ISSN: 2157-8095, 2157-8117Published: IEEE 01.06.2015Published in Proceedings / IEEE International Symposium on Information Theory (01.06.2015)“…We show that with high probability, random rank 1 matrices over a finite field are in (linearly) general position, at least provided their shape k × l is not…”
Get full text
Conference Proceeding Journal Article -
12
Performance of Random Linear Network codes concatenated with Reed-Solomon codes using turbo decoding
ISBN: 1424467446, 9781424467440ISSN: 2165-4700Published: IEEE 01.09.2010Published in 2010 6th International Symposium on Turbo Codes & Iterative Information Processing (01.09.2010)“…In this paper, we consider a broadcast application for mobile terminals where the access points are connected to the source via a fixed network. Random Linear…”
Get full text
Conference Proceeding -
13
List-Recovery of Random Linear Codes Over Small Fields
ISSN: 0018-9448, 1557-9654Published: IEEE 01.12.2025Published in IEEE transactions on information theory (01.12.2025)“…We study list-recoverability of random linear codes over small fields, both from errors and from erasures. We consider codes of rate <inline-formula> <tex-math…”
Get full text
Journal Article -
14
Keep the bursts and ditch the interleavers
ISSN: 0090-6778, 1558-0857Published: New York IEEE 01.06.2022Published in IEEE transactions on communications (01.06.2022)“…While many communications media, such as wireless and certain classes of wireline channels, typically lead to bursty errors, most decoders are designed…”
Get full text
Journal Article -
15
Weight distribution of random linear codes and Krawtchouk polynomials
ISSN: 1042-9832, 1098-2418Published: New York John Wiley & Sons, Inc 01.09.2024Published in Random structures & algorithms (01.09.2024)“…For 0<λ<1 $$ 0<\lambda <1 $$and n→∞ $$ n\to ınfty $$pick uniformly at random λn $$ \lambda n $$vectors in 0,1 n $$ {\left\{0,1\right\}}^n $$and let C $$ C $$be…”
Get full text
Journal Article -
16
Bounds for List-Decoding and List-Recovery of Random Linear Codes
ISSN: 0018-9448, 1557-9654Published: New York IEEE 01.02.2022Published in IEEE transactions on information theory (01.02.2022)“…A family of error-correcting codes is list-decodable from error fraction <inline-formula> <tex-math notation="LaTeX">p </tex-math></inline-formula> if, for…”
Get full text
Journal Article -
17
Bounds on the size of (r,δ)-locally repairable codes for fixed values q and d
ISSN: 1071-5797Published: Elsevier Inc 01.01.2026Published in Finite fields and their applications (01.01.2026)“…Erasure codes can strengthen fault-tolerance and reliability in distributed storage systems. One of these, locally repairable codes (LRCs), plays a crucial…”
Get full text
Journal Article -
18
Symbol-Level GRAND for High-Order Modulation Over Block Fading Channels
ISSN: 1089-7798, 1558-2558Published: New York IEEE 01.02.2023Published in IEEE communications letters (01.02.2023)“…Guessing random additive noise decoding (GRAND) is a noise-centric decoding method, which is suitable for low-latency communications, as it supports error…”
Get full text
Journal Article -
19
Decoding by linear programming
ISSN: 0018-9448, 1557-9654Published: New York, NY IEEE 01.12.2005Published in IEEE transactions on information theory (01.12.2005)“…This paper considers a natural error correcting problem with real valued input/output. We wish to recover an input vector f/spl isin/R/sup n/ from corrupted…”
Get full text
Journal Article -
20
Improved List-Decodability of Random Linear Binary Codes
ISSN: 0018-9448, 1557-9654Published: New York IEEE 01.03.2021Published in IEEE transactions on information theory (01.03.2021)“…There has been a great deal of work establishing that random linear codes are as list-decodable as uniformly random codes, in the sense that a random linear…”
Get full text
Journal Article

