Linear codes from simplicial complexes

descriptionPublicationkeyboard_double_arrow_right Article 24 Nov 2017 English Publisher:Springer Science and Business Media LLCJournal:Designs, Codes and Cryptography, volume 86, pages 2,167-2,181 (issn: 0925-1022, eissn: 1573-7586,

Copyright policy )

Authors: Seunghwan Chang; Jong Yoon Hyun;

doi: 10.1007/s10623-017-0442-5

Linear codes from simplicial complexes

- Summary
- Subjects
- Metrics

Abstract

zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Organizations

National Institute for Mathematical Sciences
Korea (Republic of)
Ewha Womans University
Korea (Republic of)
Korea Institute for Advanced Study
Korea (Republic of)

Keywords

optimal linear code, Authentication, digital signatures and secret sharing, minimal linear code, binary linear code, Switching theory, application of Boolean algebra; Boolean functions, Boolean function, secret sharing scheme, simplicial complex, Walsh-Hadamard transform, Linear codes (general theory)

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	88
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 1%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%