Results 21 to 30 of about 1,015,438 (326)
Optimal Linear Codes and Their Hulls
The hull of a linear code C is the intersection of C with its dual code. The goal is to study the dimensions of the hulls of optimal binary and ternary linear codes for a given length and dimension.
Stefka Bouyuklieva +1 more
doaj +1 more source
Code multiplexing using linear block codes [PDF]
This paper explores the application of code multiplexing using linear block codes in communication systems. Through a comprehensive analysis of contemporary literature on switching methods and signal modeling, the study investigates the principles of ...
Rabin Alexey +2 more
doaj +1 more source
Design of Non-Adaptive Querying Policies Based on Error Control Coding
This paper designs non-adaptive querying policies (NQPs) for the noisy 20 questions game based on error-correction codes. The querying accuracy of a specific NQP is upper bounded by a function of the minimum distance among its codewords. As a result, the
Shuai Wang +3 more
doaj +1 more source
Linear Codes and Self-Polarity
This work studies projective self-dual (PSD) and self-polar linear codes over finite fields with q elements, where q is a power of a prime. The possible parameters for which PSD codes may exist are presented, and many examples are provided.
Iliya Bouyukliev +3 more
doaj +1 more source
Linear Codes from a Generic Construction
A generic construction of linear codes over finite fields has recently received a lot of attention, and many one-weight, two-weight and three-weight codes with good error correcting capability have been produced with this generic approach.
Xiang, Can
core +1 more source
PM1 steganographic algorithm using ternary Hamming Code [PDF]
PM1 algorithm is a modification of well-known LSB steganographic algorithm. It has increased resistance to selected steganalytic attacks and increased embedding efficiency.
Kamil Kaczyński
doaj +1 more source
Quasi-linear network coding [PDF]
We present a heuristic for designing vector non-linear network codes for non-multicast networks, which we call quasi-linear network codes. The method presented has two phases: finding an approximate linear network code over the reals, and then quantizing it to a vector non-linear network code using a fixed-point representation.
Schwartz, Moshe, Medard, Muriel
openaire +3 more sources
Linear Repairing Codes and Side-Channel Attacks
To strengthen the resistance of countermeasures based on secret sharing,several works have suggested to use the scheme introduced by Shamir in 1978, which proposes to use the evaluation of a random d-degree polynomial into n ≥ d + 1 public points to ...
Hervé Chabanne +2 more
doaj +1 more source
Geometric representations of linear codes
We say that a linear code C over a field F is triangular representable if there exists a two dimensional simplicial complex $\Delta$ such that C is a punctured code of the kernel ker $\Delta$ of the incidence matrix of $\Delta$ over F and there is a ...
Cimasoni +8 more
core +1 more source
Treatment Decision‐Making Roles and Preferences Among Adolescents and Young Adults With Cancer
ABSTRACT Background Decision‐making (DM) dynamics between adolescents and young adults (AYAs) with cancer, parents, and oncologists remain underexplored in diverse populations. We examined cancer treatment DM preferences among an ethnically and socioeconomically diverse group of AYAs and their parents.
Amanda M. Gutierrez +14 more
wiley +1 more source

