Results 41 to 50 of about 223,530 (281)
Two-Point Codes for the Generalized GK curve [PDF]
, 2017 We improve previously known lower bounds for the minimum distance of certain two-point AG codes constructed using a Generalized Giulietti-Korchmaros curve (GGK). Castellanos and Tizziotti recently described such bounds for two-point codes coming from the
Barelli, Elise +4 more
core +5 more sources
Toric surface codes and Minkowski sums [PDF]
, 2006 Toric codes are evaluation codes obtained from an integral convex polytope $P \subset \R^n$ and finite field $\F_q$. They are, in a sense, a natural extension of Reed-Solomon codes, and have been studied recently by J. Hansen and D. Joyner. In this paper,
Little, John, Schenck, Hal
core +4 more sources
On Stronger Types of Locating-dominating Codes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Locating-dominating codes in a graph find their application in sensor networks and have been studied extensively over the years. A locating-dominating code can locate one object in a sensor network, but if there is more than one object, it may lead to ...
Ville Junnila +3 more
doaj +1 more source
Journal of Combinatorial Theory, Series A, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Construction and bounds for subspace codes
CoRR, 2021 Subspace codes are the $q$-analog of binary block codes in the Hamming metric. Here the codewords are vector spaces over a finite field. They have e.g. applications in random linear network coding, distributed storage, and cryptography. In this chapter we survey known constructions and upper bounds for subspace codes.
openaire +2 more sources
Binary Cyclic Codes from Explicit Polynomials over $\gf(2^m)$
, 2013 Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. In this paper, monomials and trinomials over finite fields
Ding, Cunsheng, Zhou, Zhengchun
core +2 more sources
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
Remarks on Bounds for Quantum Codes [PDF]
, 1997 We present some results that show that bounds from classical coding theory still work in many cases of quantum coding ...
Ashikhmin, Alexei
core +1 more source
The DMT classification of real and quaternionic lattice codes
, 2018 In this paper we consider space-time codes where the code-words are restricted to either real or quaternion matrices. We prove two separate diversity-multiplexing gain trade-off (DMT) upper bounds for such codes and provide a criterion for a lattice code
Luzzi, Laura, Vehkalahti, Roope
core +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT In pediatric patients, T‐cell lymphoblastic lymphoma (T‐LBL) survival exceeds 80%. Relapse remains associated with limited curative options. Frontline treatment is largely extrapolated from T‐cell acute lymphoblastic leukemia (T‐ALL) treatment, reflecting the ongoing debate, whether both entities represent distinct diseases or variants within ...
Marie C. Heider +4 more
wiley +1 more source