Bouyukliev, Iliya
Published in
Mathematical Software – ICMS 2020

This paper is devoted to the program Generation which is a self-containing console application for classification of linear codes. It can be used for codes over fields with \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek}...

Bouyuklieva, Stefka Bouyukliev, Iliya
Published in
Mathematical Software – ICMS 2020

An approach for classification of linear codes with given parameters starting from their proper residual codes or subcodes is presented. The base of the algorithm is the concept of canonical augmentation which is important for parallel implementations. The algorithms are implemented in the programs LengthExtension and DimExtension of the package Qe...

De Bruyn, Bart Gao, Mou

A pseudo-embedding of a point-line geometry is a representation of the geometry into a projective space over the field F-2 such that every line corresponds to a frame of a subspace. Such a representation is called homogeneous if every automorphism of the geometry lifts to an automorphism of the projective space. In this paper, we determine all homo...

Charpin, Pascale Peng, Jie

The associated codes of almost perfect nonlinear (APN) functions have been widely studied. In this paper we consider more generally the codes associated with functions that have differential uniformity at least 4. We emphasize, for such a function F , the role of codewords of weight 3 and 4 and of some cosets of its associated code C F. We give som...

Beelen, Peter Singh, Prasant

In this article we consider linear codes coming from skew-symmetric determinantal varieties, which are defined by the vanishing of minors of a certain fixed size in the space of skew-symmetric matrices. In odd characteristic, the minimum distances of these codes are determined and a recursive formula for the weight of a general codeword in these co...

Beelen, Peter Singh, Prasant

In this article we consider linear codes coming from skew-symmetric determinantal varieties, which are defined by the vanishing of minors of a certain fixed size in the space of skew-symmetric matrices. In odd characteristic, the minimum distances of these codes are determined and a recursive formula for the weight of a general codeword in these co...

Beelen, Peter Singh, Prasant

In this article we consider linear codes coming from skew-symmetric determinantal varieties, which are defined by the vanishing of minors of a certain fixed size in the space of skew-symmetric matrices. In odd characteristic, the minimum distances of these codes are determined and a recursive formula for the weight of a general codeword in these co...

Beelen, Peter Singh, Prasant

In this article we consider linear codes coming from skew-symmetric determinantal varieties, which are defined by the vanishing of minors of a certain fixed size in the space of skew-symmetric matrices. In odd characteristic, the minimum distances of these codes are determined and a recursive formula for the weight of a general codeword in these co...

Beelen, Peter Singh, Prasant

In this article we consider linear codes coming from skew-symmetric determinantal varieties, which are defined by the vanishing of minors of a certain fixed size in the space of skew-symmetric matrices. In odd characteristic, the minimum distances of these codes are determined and a recursive formula for the weight of a general codeword in these co...

Ebrahimi, Mohammad Izadara, Alireza
Published in
Soft Computing

This paper defines the concept of ideal entropy for BCI-algebras in general, and it tries to describe some of its properties. Moreover, the present study will show that F2n\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} ...