Results 81 to 90 of about 459 (161)

새로운 소실 채널을 위한 자기동형 군 복호기 및 부분 접속 복구 부호 및 일반화된 근 프로토그래프 LDPC 부호의 설계 [PDF]

open access: yes, 2019
학위논문 (박사)-- 서울대학교 대학원 : 공과대학 전기·컴퓨터공학부, 2019. 2. 노종선.In this dissertation, three main contributions are given asi) new two-stage automorphism group decoders (AGD) for cyclic codes in the erasure channel, ii) new constructions of binary and ternary ...
김찬기
core  

Constacyclic locally recoverable codes from their duals

open access: yes
A code has locality r if a symbol in any coordinate of a codeword in the code can be recovered by accessing the value of at most r other coordinates. Such codes are called locally recoverable codes (LRCs for short).
Koroglu, Mehmet Emin, Zengin, Rabia
core   +1 more source

On Sequential Locally Repairable Codes

open access: yes, 2018
We consider the locally repairable codes (LRCs), aiming at sequentially recovering multiple erasures; in particular, we propose and study the so-called (n, k, r, t)-sequential LRCs (SLRC) as an [n, k] linear code, where any t' (≤ t) erasures can be ...
Song, W   +8 more
core   +1 more source

Poster Sessions

open access: yes
HemaSphere, Volume 10, Issue S1, June 2026.
wiley   +1 more source

Lignin conversion to β-ketoadipic acid by Pseudomonas putida via metabolic engineering and bioprocess development. [PDF]

open access: yesSci Adv, 2023
Werner AZ   +13 more
europepmc   +1 more source

The (r, {\delta})-Locality of Repeated-Root Cyclic Codes with Prime Power Lengths

open access: yes
Locally repairable codes (LRCs) are designed for distributed storage systems to reduce the repair bandwidth and disk I/O complexity during the storage node repair process.
Zhao, Wei   +3 more
core  

Role of quiescent cells in the homeostatic maintenance of the adult submandibular salivary gland. [PDF]

open access: yesiScience, 2022
Serrano Martinez P   +6 more
europepmc   +1 more source

LRCS: Duality, LP bounds, and field size. [PDF]

open access: yesDes Codes Cryptogr
Gruica A, Jany B, Ravagnani A.
europepmc   +1 more source

Home - About - Disclaimer - Privacy