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/2009

01-09-2009

A generalized Gleason–Pierce–Ward theorem

Authors: Jon-Lark Kim, Xiaoyu Liu

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

Login to get access

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

search-config
loading …
previous article An improvement of discrete Tardos fingerprinting codes
next article The Diffie–Hellman problem and generalization of Verheul’s theorem
Metadata
Title
A generalized Gleason–Pierce–Ward theorem
Authors
Jon-Lark Kim
Xiaoyu Liu
Publication date
01-09-2009
Publisher
Springer US
Published in
Designs, Codes and Cryptography / Issue 3/2009
Print ISSN: 0925-1022
Electronic ISSN: 1573-7586
DOI
https://doi.org/10.1007/s10623-009-9286-y

Other articles of this Issue 3/2009

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

OriginalPaper

Linearity properties of binary FCSR sequences

OriginalPaper

An improvement of discrete Tardos fingerprinting codes

OriginalPaper

Optimal conflict-avoiding codes of length n ≡ 0 (mod 16) and weight 3

OriginalPaper

The subconstituent algebra of strongly regular graphs associated with a Latin square

OriginalPaper

An application of the O’Nan-Scott theorem to the group generated by the round functions of an AES-like cipher

OriginalPaper

The Diffie–Hellman problem and generalization of Verheul’s theorem

Premium Partner

    Image Credits