Results 21 to 30 of about 33,922 (251)
Estimating Explanatory Extensions of Dichotomous and Polytomous Rasch Models: The eirm Package in R
Psych, 2021 Explanatory item response modeling (EIRM) enables researchers and practitioners to incorporate item and person properties into item response theory (IRT) models.
Okan Bulut +2 more
doaj +1 more source
Common Complements of Linear Subspaces and the Sparseness of MRD Codes [PDF]
, 2022 Motivated by applications to the theory of rank-metric codes, we study the problem of estimating the number of common complements of a family of subspaces over a finite field in terms of the cardinality of the family and its intersection structure.
Ravagnani, Alberto, Gruica, Anina
core +1 more source
Shortened Linear Codes over Finite Fields [PDF]
, 2021 The puncturing and shortening techniques are two important approaches to constructing new linear codes from old ones. In the past 70 years, a lot of progress on the puncturing technique has been made, and many works on punctured linear codes have been ...
Ding, Cunsheng +2 more
core +1 more source
Semiotics of the Clothing System in Molavi's Masnavi [PDF]
Matn/Pizhūhī-i Adabī, 2023 The clothing system is one of the important systems that have a significant presence in literary texts. Rumi is one of the poets who was able to transform the system of language signs of clothing into literary signs.
Effat Neqabi, Mehrnoosh Esrafilzadeh
doaj +1 more source
Graph-Based Codes and Iterative Decoding [PDF]
, 2003 The field of error correcting codes was revolutionized by the introduction of turbo codes in 1993. These codes demonstrated dramatic performance improvements over any previously known codes, with significantly lower complexity.
Khandekar, Aamod Dinkar
core +1 more source
Linear cutting blocking sets and minimal codes in the rank metric [PDF]
, 2022 This work investigates the structure of rank-metric codes in connection with concepts from finite geometry, most notably the q-analogues of projective systems and blocking sets.
Ravagnani A. +3 more
core +4 more sources
From Product Codes to Structured Generalized LDPC Codes [PDF]
, 2010 Product codes, due to their relatively large minimum distance, are often seen as a natural solution for applications requiring low error floors.
Paolini, Enrico +10 more
core +1 more source
The linear codes of t-designs held in the Reed-Muller and Simplex codes [PDF]
, 2021 A fascinating topic of combinatorics is the study of t-designs, which has a very long history. The incidence matrix of a t-design generates a linear code over GF(q) for any prime power q, which is called the linear code of the t-design over GF(q). On the
Ding, Cunsheng, Tang, Chunming
core +1 more source
A Decoding Algorithm for LDPC Codes Over Erasure Channels with Sporadic Errors [PDF]
, 2010 An efficient decoding algorithm for low-density parity-check (LDPC) codes on erasure channels with sporadic errors (i.e., binary error-and-erasure channels with error probability much smaller than the erasure probability) is proposed and its performance ...
Paolini, Enrico +9 more
core +1 more source
Bounds on the maximal minimum distance of linear locally repairable codes [PDF]
, 2016 Locally repairable codes (LRCs) are error correcting codes used in distributed data storage. Besides a global level, they enable errors to be corrected locally, reducing the need for communication between storage nodes.
Pöllänen, Antti, +11 more
core +1 more source