Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound

SLO

First page / Show document

Show document

A- | A+ | Print

Title:	Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound
Authors:	ID Pašalić, Enes (Author) ID Rodríguez, René (Author) ID Zhang, Fengrong (Author) ID Wei, Yongzhuang (Author)
Files:	https://link.springer.com/article/10.1007/s12095-021-00491-1
Language:	English
Work type:	Unknown
Typology:	1.01 - Original Scientific Article
Organization:	IAM - Andrej Marušič Institute
Keywords:	minimal linear codes, ǂthe ǂAshikhmin-Barg bound, characteristic function, root Boolean function
Year of publishing:	2021
Number of pages:	str. 1-23
PID:	20.500.12556/RUP-16776
UDC:	519.6
ISSN on article:	1936-2455
DOI:	10.1007/s12095-021-00491-1
COBISS.SI-ID:	68495875
Publication date in RUP:	15.07.2021
Views:	1463
Downloads:	29
Metadata:
:	Copy citation

Average score:	(0 votes)
Your score:	Voting is allowed only for logged in users.
Share:

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Title:	Cryptography and communications
Shortened title:	Cryptogr. commun.
Publisher:	Springer
ISSN:	1936-2455
COBISS.SI-ID:	517611033

Language:	English
Keywords:	minimalne linearne kode, Ashikhim-Bargova meja, karakteristična funkcija, korenska Boolova funkcija

Leave comment

You must log in to leave a comment.

Comments (0)

0 - 0 / 0

There are no comments!

Back