Results 51 to 60 of about 7,804,605 (312)
On Parameter Optimization for Staircase Codes [PDF]
Optical Fiber Communication Conference, 2015 We discuss the optimization of staircase code parameters based on density evolution. An extension of the original code construction is proposed, leading to codes with steeper waterfall performance.
Christian Häger +5 more
openaire +1 more source
QPSK Block-Modulation Codes for Unequal Error Protection [PDF]
, 1995 Unequal error protection (UEP) codes find applications in broadcast channels, as well as in other digital communication systems, where messages have different degrees of importance.
Lin, Shu, Morelos-Zaragoza, Robert H
core +2 more sources
How Long Can Optimal Locally Repairable Codes Be? [PDF]
IEEE Transactions on Information Theory, 2018 A locally repairable code (LRC) with locality ${r}$ allows for the recovery of any erased codeword symbol using only ${r}$ other codeword symbols. A Singleton-type bound dictates the best possible tradeoff between the dimension and distance of LRCs ...
V. Guruswami, C. Xing, Chen Yuan
semanticscholar +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT End‐of‐life conversations with adolescents and young adults (AYAs) with cancer rarely occur without the guidance of healthcare professionals. As a part of the ‘Difficult Discussions’ study, focused on palliative care and advance care planning discussions with AYAs with cancer, we investigated the factors that healthcare professionals identify ...
Justine Lee +9 more
wiley +1 more source
Two Families of Optimal Binary Linear Complementary Pairs of Codes
MathematicsThe optimal security parameters for binary linear complementary pair (LCP) codes are open. Inspired by this, we study LCPs of codes. In this paper, we construct two families of optimal binary LCPs of codes.
Xia Li, Zhaole Li
doaj +1 more source
Optimal Prefix Free Codes with Partial Sorting
Algorithms, 2019 We describe an algorithm computing an optimal prefix free code for n unsorted positive weights in time within O ( n ( 1 + lg α ) ) ⊆ O ( n lg n ) , where the alternation α ∈ [ 1 . .
Jérémy Barbay
doaj +1 more source
Constructions of Binary Locally Repairable Codes With Multiple Recovering Sets
IEEE Access, 2021 Locally repairable codes (LRCs) with multiple recovering sets are highly demanded in distributed storage systems. In this letter, we generalize the construction of WZL code proposed by Wang et al.
Jiaming Teng, Lingfei Jin
doaj +1 more source
Asymptotic optimality of antidictionary codes [PDF]
2010 IEEE International Symposium on Information Theory, 2010 5 pages, to appear in the proceedings of 2010 IEEE International Symposium on Information Theory (ISIT2010)
Takahiro Ota, Hiroyoshi Morita
openaire +2 more sources
Optimal Ferrers Diagram Rank-Metric Codes [PDF]
, 2014 Optimal rank-metric codes in Ferrers diagrams are considered. Such codes consist of matrices having zeros at certain fixed positions and can be used to construct good codes in the projective space.
Etzion, Tuvi, Wachter-Zeh, Antonia
core
On Optimal Binary One-Error-Correcting Codes of Lengths $2^m-4$ and $2^m-3$
, 2011 Best and Brouwer [Discrete Math. 17 (1977), 235-245] proved that triply-shortened and doubly-shortened binary Hamming codes (which have length $2^m-4$ and $2^m-3$, respectively) are optimal.
Krotov, Denis S. +2 more
core +1 more source