Results 1 to 10 of about 159,834 (164)
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.
Thomas Britz, Keisuke Shiromoto
exaly +4 more sources
Asymmetric Binary Covering Codes
Journal of Combinatorial Theory - Series A, 2002 An asymmetric binary covering code of length n and radius R is a subset C of the n-cube Q_n such that every vector x in Q_n can be obtained from some vector c in C by changing at most R 1's of c to 0's, where R is as small as possible. K^+(n,R) is defined as the smallest size of such a code. We show K^+(n,R) is of order 2^n/n^R for constant R, using an
Robert B Ellis, Andrew B Kahng
exaly +3 more sources
The Polar Code's Implications for Safe Ship Operations in the Arctic Region [PDF]
TransNav, 2020 Simultaneously with a decreasing sea ice cover in the Arctic region an increase in ship traffic is experienced in these waters, meaning a higher probability of accidents and incidents to occur. The capability to handle emergency situations for shipowners,
Espen Engtrø +2 more
doaj +1 more source
Covering Radius of Melas Codes [PDF]
IEEE Transactions on Information Theory, 2022 We prove that the covering radius of the Melas code M (m, q) of length n = q m − 1 over Fq is 2 if q > 3. We also prove that the covering radius of M (m, 3) is 3 is m ≥ 3, the covering radius of M (2, 3) is 4, and the covering radii of M (1, 2) and M (1, 3) are 1.
Minjia Shi +3 more
openaire +3 more sources
On Codes Over R and its Bounds of Some kind of Block Repetition Codes in R
InPrime, 2022 This correspondence determines the lower and upper bounds of the covering radius in some kind of block repetition codes over the finite ring R=Z_2 Z_*, where Z_*=Z_2+vZ_2+v^2 Z_2, v^3=v.
P Chella Pandian
doaj +1 more source
Generalized sparse codes for non-Gaussian channels: Code design, algorithms, and applications
Fundamental Research, 2022 In this paper, generalized sparse (GS) codes are proposed to support reliable and efficient transmission over non-Gaussian channels. Specifically, by expanding the single-parity check (SPC) code constraints with powerful algebraic codes, GS codes ...
Zhao Chen +3 more
doaj +1 more source
Inequalities for covering codes [PDF]
IEEE Transactions on Information Theory, 1988 Summary: Any code \(C\) with covering radius \(R\) must satisfy a set of linear inequalities that involve the Lloyd polynomial \(L_ R(x)\); these generalize the sphere bound. The ``syndrome graphs'' associated with a linear code \(C\) help to keep track of low weight vectors in the same coset of \(C\) (if there are too many such vectors \(C\) cannot ...
A. Robert Calderbank, Neil J. A. Sloane
openaire +2 more sources
Investigation gas behavior inside a gas centrifuge using dsmc code developed and dsmcFOAM solver [PDF]
مجله علوم و فنون هستهای, 2021 To model a gas behavior within a centrifuge machine, a powerful tool is required similarly. With high-speed cover, all the computational limitations for applying the influential derives such as feed, scoop, baffle effects, etc., formed flow regimes ...
S. Yousefi nasab +4 more
doaj +1 more source
Penandatanganan Akta Notariil Diluar Kantor Notaris Yang Masuk Dalam Lingkup Wilayah Jabatannya
Jurnal Ilmu Kenotariatan, 2020 The notary has a domicile, namely the regency / city where the office is located covering area within a province from his domicile. This authority is limited by the prohibition of a notary to conduct their duties outside of the covering area. The signing
Andika Putra Eskanugraha
doaj +1 more source
Homomorphic Logical Measurements
PRX Quantum, 2023 Shor and Steane ancillae are two well-known methods for fault-tolerant logical measurements, which are successful on small codes and their concatenations.
Shilin Huang +2 more
doaj +1 more source