Not Enough LESS: An Improved Algorithm for Solving Code Equivalence Problems over F-q

dc.contributor.author	Beullens, Ward
dc.date.accessioned	2021-12-07T09:43:05Z
dc.date.available	2021-11-04T03:04:51Z
dc.date.available	2021-12-07T09:43:05Z
dc.date.issued	2021
dc.identifier.doi	10.1007/978-3-030-81652-0_15
dc.identifier.eisbn	978-3-030-81652-0
dc.identifier.isbn	978-3-030-81651-3
dc.identifier.issn	0302-9743
dc.identifier.uri	https://imec-publications.be/handle/20.500.12860/38380
dc.publisher	SPRINGER INTERNATIONAL PUBLISHING AG
dc.source.beginpage	387
dc.source.conference	27th International Conference on Selected Areas in Cryptography (SAC)
dc.source.conferencedate	OCT 21-23, 2020
dc.source.conferencelocation	Virtual
dc.source.endpage	403
dc.source.journal	Lecture Notes in Computer Science
dc.source.numberofpages	17
dc.source.volume	12804
dc.subject.keywords	AUTOMORPHISM-GROUPS
dc.subject.keywords	LINEAR CODES
dc.title	Not Enough LESS: An Improved Algorithm for Solving Code Equivalence Problems over F-q
dc.type	Proceedings paper
dspace.entity.type	Publication
Files
Publication available in collections:	Conference contributions

Date