Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Designs, Codes and Cryptography
Published in: Designs, Codes and Cryptography 3/2006

01-06-2006

Blocking All Generators of Q+(2n + 1,3), n ≥ 4

Authors: Jan De Beule, Leo Storme

Published in: Designs, Codes and Cryptography | Issue 3/2006

Login to get access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …
previous article On Intersection Problem for Perfect Binary Codes
next article New Algorithms of Distance-Increasing Mappings from Binary Vectors to Permutations by Swaps
Metadata
Title
Blocking All Generators of Q+(2n + 1,3), n ≥ 4
Authors
Jan De Beule
Leo Storme
Publication date
01-06-2006
Publisher
Kluwer Academic Publishers
Published in
Designs, Codes and Cryptography / Issue 3/2006
Print ISSN: 0925-1022
Electronic ISSN: 1573-7586
DOI
https://doi.org/10.1007/s10623-005-5034-0

Other articles of this Issue 3/2006

Designs, Codes and Cryptography 3/2006 Go to the issue

OriginalPaper

On Intersection Problem for Perfect Binary Codes

OriginalPaper

The Two-Point Codes with the Designed Distance on a Hermitian Curve in Even Characteristic

OriginalPaper

Designs from the Group PSL2(q), q Even

OriginalPaper

A Weak Key Test for Braid Based Cryptography

OriginalPaper

New Algorithms of Distance-Increasing Mappings from Binary Vectors to Permutations by Swaps

OriginalPaper

Bounds on Codes Derived by Counting Components in Varshamov Graphs

Premium Partner

    Image Credits