메뉴 건너뛰기
Library Notice
Institutional Access
If you certify, you can access the articles for free.
Check out your institutions.
ex)Hankuk University, Nuri Motors
Log in Register Help KOR
Subject

A New Extension Method for Minimal Codes
Recommendations
Search
Questions

극소 부호의 새로운 확장 기법

논문 기본 정보

Type
Academic journal
Author
Jin-Ho Chung (University of Ulsan)
Journal
Institute of Korean Electrical and Electronics Engineers Journal of IKEEE Vol.26 No.3 KCI Accredited Journals
Published
2022.9
Pages
174 - 177 (4page)

Usage

cover
📌
Topic
📖
Background
🔬
Method
🏆
Result
A New Extension Method for Minimal Codes
Ask AI
Recommendations
Search
Questions

Abstract· Keywords

Report Errors
In a secret sharing scheme, secret information must be distributed and stored to users, and confidentiality must be able to be reconstructed only from an authorized subset of users. To do this, secret information among different code words must not be subordinate to each other. The minimal code is a kind of linear block code to distribute these secret information not mutually dependent. In this paper, we present a novel extension technique for minimal codes. The product of an arbitrary vector and a minimal code produces a new minimal code with an extended length and Hamming weight. Accordingly, it is possible to provide minimal codes with parameters not known in the literature.

Contents

Abstract
요약
Ⅰ. 서론
Ⅱ. 배경
Ⅲ. 본론
Ⅳ. 결론
References

References (0)

Add References

Recommendations

It is an article recommended by DBpia according to the article similarity. Check out the related articles!

Related Authors

Recently viewed articles

Comments(0)

0

Write first comments.

UCI(KEPA) : I410-ECN-0101-2023-056-000099485