Results 11 to 20 of about 9,454,079 (375)
On the Covering Dimension of a Linear Code [PDF]
IEEE Transactions on Information Theory, 2016 The critical exponent of a matroid is one of the important parameters in matroid theory and is related to the Rota and Crapo's Critical Problem. This paper introduces the covering dimension of a linear code over a finite field, which is analogous to the critical exponent of a representable matroid.
Britz, T, Shiromoto, K
openaire +5 more sources
Quantum Resistant Random Linear Code Based Public Key Encryption Scheme RLCE [PDF]
International Symposium on Information Theory, 2015 Lattice based encryption schemes and linear code based encryption schemes have received extensive attention in recent years since they have been considered as post-quantum candidate encryption schemes.
Wang, Yongge
core +5 more sources
The extended codes of some linear codes [PDF]
Finite Fields and Their Applications, 2023 The classical way of extending an $[n, k, d]$ linear code $\C$ is to add an overall parity-check coordinate to each codeword of the linear code $\C$. This extended code, denoted by $\overline{\C}(-\bone)$ and called the standardly extended code of $\C$, is a linear code with parameters $[n+1, k, \bar{d}]$, where $\bar{d}=d$ or $\bar{d}=d+1$.
Zhonghua Sun 0001 +2 more
openaire +4 more sources
The JOREK non-linear extended MHD code and applications to large-scale instabilities and their control in magnetically confined fusion plasmas [PDF]
Nuclear Fusion, 2020 JOREK is a massively parallel fully implicit non-linear extended magneto-hydrodynamic (MHD) code for realistic tokamak X-point plasmas. It has become a widely used versatile simulation code for studying large-scale plasma instabilities and their control ...
M. Hoelzl +52 more
semanticscholar +1 more source
Large scale and linear scaling DFT with the CONQUEST code. [PDF]
Journal of Chemical Physics, 2020 We survey the underlying theory behind the large-scale and linear scaling density functional theory code, conquest, which shows excellent parallel scaling and can be applied to thousands of atoms with diagonalization and millions of atoms with linear ...
A. Nakata +10 more
semanticscholar +1 more source
How many weights can a linear code have? [PDF]
Designs, Codes and Cryptography, 2018 We study the combinatorial function L(k, q), the maximum number of nonzero weights a linear code of dimension k over Fq\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \
Minjia Shi +3 more
semanticscholar +1 more source
Private information retrieval in distributed storage systems using an arbitrary linear code [PDF]
International Symposium on Information Theory, 2016 We propose an information-theoretic private information retrieval (PIR) scheme for distributed storage systems where data is stored using a linear systematic code of rate R> 1/2.
Siddhartha Kumar, E. Rosnes, A. G. Amat
semanticscholar +1 more source
On Some Families of Codes Related to the Even Linear Codes Meeting the Grey–Rankin Bound
Mathematics, 2022 Bounds for the parameters of codes are very important in coding theory. The Grey–Rankin bound refers to the cardinality of a self-complementary binary code. Codes meeting this bound are associated with families of two-weight codes and other combinatorial
Iliya Bouyukliev +2 more
doaj +1 more source
On the Grassmann graph of linear codes [PDF]
Finite Fields and Their Applications, 2021 Let $Γ(n,k)$ be the Grassmann graph formed by the $k$-dimensional subspaces of a vector space of dimension $n$ over a field $\mathbb F$ and, for $t\in \mathbb{N}\setminus \{0\}$, let $Δ_t(n,k)$ be the subgraph of $Γ(n,k)$ formed by the set of linear $[n,k]$-codes having minimum dual distance at least $t+1$. We show that if $|{\mathbb F}|\geq{n\choose t}
Cardinali, Ilaria +2 more
openaire +6 more sources
Sliding Window Random Linear Code (RLC) Forward Erasure Correction (FEC) Schemes for FECFRAME
Request for Comments, 2020 This document specifies Sliding Window Random Linear Code (RLC) Forward Erasure Correction (FEC) Schemes for the QUIC transport protocol, in order to recover from packet losses.
Vincent Roca, Belkacem Teibi
semanticscholar +1 more source