Certain equivalent conditions are given for the semilinear equivalence of linear codes by using the relative generalized Hamming weight and the value function.http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000289902100008&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=8e1609b174ce4e31116a60747a720701Computer Science, Information SystemsSCI(E)1ARTICLE4787-7945
In recent years, the notion of rank metric in the context of coding theory has known many interestin...
Motivated by applications in cryptology K. Wei introduced in 1991 the concept of a generalized Hammi...
In this work, we explore the relationship between the graded free resolution of some monomial ideals...
We first present an equivalent definition of relative generalized Hamming weights of a linear code a...
The generalized Hamming weights of a linear code have been extensively studied since Wei first use t...
AbstractIn this note, we consider the notion of simple components of a linear code over the field F ...
Error control codes are widely used to increase the reliability of transmission of information over ...
The rth generalized Hamming weight of a linear code is the minimum support size of any r-dimensional...
We define generalized Hamming weights for almost affine codes. We show that this definition is natur...
Motivated by applications in cryptology, Wei introduced in 1991 the concept of a generalized Hamming...
An irreducible cyclic (n, k) code is said to be semiprimitive if n = (2<SUP>k</SUP> − 1)/N where N &...
When discussing equivalent codes, the literature tends to define equivalence differently for linear ...
We consider linear codes over some fixed finite field extension Fq m/Fq, where Fq is an arbitrary finit...
We consider linear codes over some fixed finite field extension Fq m/Fq, where Fq is an arbitrary finit...
The definition of generalized Hamming weights (GHW) for linear codes over Galois rings is discussed....
In recent years, the notion of rank metric in the context of coding theory has known many interestin...
Motivated by applications in cryptology K. Wei introduced in 1991 the concept of a generalized Hammi...
In this work, we explore the relationship between the graded free resolution of some monomial ideals...
We first present an equivalent definition of relative generalized Hamming weights of a linear code a...
The generalized Hamming weights of a linear code have been extensively studied since Wei first use t...
AbstractIn this note, we consider the notion of simple components of a linear code over the field F ...
Error control codes are widely used to increase the reliability of transmission of information over ...
The rth generalized Hamming weight of a linear code is the minimum support size of any r-dimensional...
We define generalized Hamming weights for almost affine codes. We show that this definition is natur...
Motivated by applications in cryptology, Wei introduced in 1991 the concept of a generalized Hamming...
An irreducible cyclic (n, k) code is said to be semiprimitive if n = (2<SUP>k</SUP> − 1)/N where N &...
When discussing equivalent codes, the literature tends to define equivalence differently for linear ...
We consider linear codes over some fixed finite field extension Fq m/Fq, where Fq is an arbitrary finit...
We consider linear codes over some fixed finite field extension Fq m/Fq, where Fq is an arbitrary finit...
The definition of generalized Hamming weights (GHW) for linear codes over Galois rings is discussed....
In recent years, the notion of rank metric in the context of coding theory has known many interestin...
Motivated by applications in cryptology K. Wei introduced in 1991 the concept of a generalized Hammi...
In this work, we explore the relationship between the graded free resolution of some monomial ideals...