Binary Codes with Locality for Four Erasures
In this paper, codes with locality for four erasures are considered. An upper bound on the rate of codes with locality with sequential recovery from four erasures is derived. The rate bound derived here is field independent. An optimal construction for binary codes meeting this rate bound is also provided. The construction is based on regular graphs of
Balaji Srinivasan Babu +2 more
openaire +2 more sources
Genetic algorithm aided design of component codes for irregular variable length coding [PDF]
In this paper we propose a novel Real-Valued Free Distance Metric (RV-FDM) for comparing the error correction capabilities of Variable Length Error Correction (VLEC) codebooks that have the same integer-valued free distance lower bounds.
Hanzo, L., Maunder, R. G.
core +1 more source
Resistant Peanut Genotype Reprograms Rhizosphere Metabolism to Enhance Bacterial Wilt Suppression
The resistant peanut genotype selectively recruits beneficial bacteria, which coincides with the activation of salicylic acid (SA)‐dependent systemic acquired resistance (SAR) against Ralstonia solanacearum. Keystone rhizosphere metabolites are positively correlated with both beneficial microbiome assembly and SAR gene expression.
Rui Ren +20 more
wiley +1 more source
On Delay and Security in Network Coding [PDF]
In this thesis, delay and security issues in network coding are considered. First, we study the delay incurred in the transmission of a fixed number of packets through acyclic networks comprised of erasure links. The two transmission schemes studied are
Dikaliotis, Theodoros K.
core +1 more source
Femtosecond‐Laser‐Induced Physical Unclonable Random Maze Structure for Storage‐Free Encryption
Femtosecond‐laser‐induced gold random maze structures serve as multimodal physical unclonable functions for storage‐free encryption. Their stochastic optical, electrical, and Raman responses are generated by plasmon‐assisted Marangoni formation and converted into AES‐compatible keys without permanent secret‐key storage, offering a portable route toward
Shiru Jiang +6 more
wiley +1 more source
Quasi-cyclic Generalized LDPC codes with low error floors
In this paper, a novel methodology for designing structured generalized LDPC (G-LDPC) codes is presented. The proposed design results in quasi-cyclic G-LDPC codes for which efficient encoding is feasible through shift-register-based circuits.
Ryan, William E. +6 more
core +1 more source
Reconfigurable Selector‐Only Memory (SOM) for Scalable Neuromorphic Computing
ABSTRACT Highly scalable reconfigurable neuromorphic devices are critical for addressing continual‐learning challenges in artificial intelligence. However, the scalability of existing reconfigurable devices is severely constrained by limited operating margins and insufficient process maturity.
Jin‐Yu Wen +7 more
wiley +1 more source
Optimal Construction for Decoding 2D Convolutional Codes over an Erasure Channel
In general, the problem of building optimal convolutional codes under a certain criteria is hard, especially when size field restrictions are applied.
Raquel Pinto +2 more
doaj +1 more source
Low-density parity-check codes and their rateless relatives
This survey guides the reader through the extensive open literature that is covering the family of low-density parity-check LDPC codes and their rateless relatives.
Sheng Chen +5 more
core +1 more source
Field‐Frustrated Cooperative Distortions: Suppressing Jahn‐Teller Ordering via Microwave Annealing
Microwave annealing decouples local Jahn‐Teller distortions from long‐range cooperative ordering in CuFe2O4, stabilizing a metastable cubic phase that remains locally distorted yet globally symmetry‐frustrated. Synchrotron XRD, PDF, XPS, and in situ thermal cycling reveal how non‐equilibrium MW‐phonon interactions suppress cooperative orbital‐lattice ...
Daryoosh Vashaee, Kelvin Dsouza
wiley +1 more source

