×
May 6, 2021 · We will also present a new bound on two different parameters of the relative generalized Hamming weight. Published in: IEEE Transactions on ...
Abstract—Based on the applications to the wire-tap channel and bounds on the relative generalized Hamming weight, we will introduce optimal codes of type I and ...
Based on the applications to the wire-tap channel and bounds on the relative generalized Hamming weight, we will introduce optimal codes of type I and type ...
Based on the applications to the wire-tap channel and bounds on the relative generalized Hamming weight, we will introduce optimal codes of type ...
We introduce relative generalized Hamming weights to codes over chain rings and principal ideal rings, and present equivalent descriptions and bounds on them.
Using the notion of generalized Hamming weights, we give better list size bounds for both the tensoring and interleaving of binary linear codes. By analyzing ...
We will solve an open problem therein about the second relative greedy weight of 3-dimensional codes with respect to 1-dimensional subcodes.
Mar 10, 2020 · A generalization of these weights is known as the relative generalized Hamming weight of a code with respect to a proper subcode . This notion ...
People also ask
By using generalized Hamming weights with respect to rank, we generalize some results obtained in recent references. We introduce relative generalized Hamming ...
Oct 22, 2024 · Relative generalized Hamming weights (RGHWs) of two linear codes are fundamental for evaluating the security of ramp secret sharing schemes and ...