Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 장승환 | - |
dc.date.accessioned | 2018-11-21T16:30:57Z | - |
dc.date.available | 2018-11-21T16:30:57Z | - |
dc.date.issued | 2018 | - |
dc.identifier.issn | 0925-1022 | - |
dc.identifier.issn | 1573-7586 | - |
dc.identifier.other | OAK-21770 | - |
dc.identifier.uri | https://dspace.ewha.ac.kr/handle/2015.oak/246919 | - |
dc.description.abstract | In this article we introduce a method of constructing binary linear codes and computing their weights by means of Boolean functions arising from mathematical objects called simplicial complexes. Inspired by Adamaszek (Am Math Mon 122:367-370, 2015) we introduce n-variable generating functions associated with simplicial complexes and derive explicit formulae. Applying the construction (Carlet in Finite Field Appl 13:121-135, 2007; Wadayama in Des Codes Cryptogr 23:23-33, 2001) of binary linear codes to Boolean functions arising from simplicial complexes, we obtain a class of optimal linear codes and a class of minimal linear codes. | - |
dc.language | English | - |
dc.publisher | SPRINGER | - |
dc.subject | Simplicial complex | - |
dc.subject | Binany linear code | - |
dc.subject | Boolean function | - |
dc.subject | Walsh-Hadamard transform | - |
dc.subject | Optimal linear code | - |
dc.subject | Minimal linear code | - |
dc.subject | Secret sharing scheme | - |
dc.title | Linear codes from simplicial complexes | - |
dc.type | Article | - |
dc.relation.issue | 10 | - |
dc.relation.volume | 86 | - |
dc.relation.index | SCIE | - |
dc.relation.index | SCOPUS | - |
dc.relation.startpage | 2167 | - |
dc.relation.lastpage | 2181 | - |
dc.relation.journaltitle | DESIGNS CODES AND CRYPTOGRAPHY | - |
dc.identifier.doi | 10.1007/s10623-017-0442-5 | - |
dc.identifier.wosid | WOS:000442209100002 | - |
dc.identifier.scopusid | 2-s2.0-85035091727 | - |
dc.author.google | Chang, Seunghwan | - |
dc.author.google | Hyun, Jong Yoon | - |
dc.contributor.scopusid | 장승환(55494300500) | - |
dc.date.modifydate | 20210915131936 | - |