The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
이 문서의 목적은 그룹 테스트 프레임워크에서 결함 샘플을 찾는 상한선을 보여주는 것입니다. 이를 위해 우리는 코딩 이론에서 해밍 가중치의 최소화를 활용하고 디코딩 방식에 대한 오류 확률을 정의합니다. 우리는 오류 확률에 대한 새로운 상한선을 도출합니다. 그룹 행렬의 최적 밀도 비율에서 상한과 하한이 서로 일치함을 보여줍니다. 우리는 불량률이 증가함에 따라 소수의 검정만으로 불량 표본을 찾기 위해 그룹 행렬이 더 희박해야 한다는 결론을 내렸습니다.
Jin-Taek SEONG
Mokpo National University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Jin-Taek SEONG, "A New Upper Bound for Finding Defective Samples in Group Testing" in IEICE TRANSACTIONS on Information,
vol. E103-D, no. 5, pp. 1164-1167, May 2020, doi: 10.1587/transinf.2019EDL8187.
Abstract: The aim of this paper is to show an upper bound for finding defective samples in a group testing framework. To this end, we exploit minimization of Hamming weights in coding theory and define probability of error for our decoding scheme. We derive a new upper bound on the probability of error. We show that both upper and lower bounds coincide with each other at an optimal density ratio of a group matrix. We conclude that as defective rate increases, a group matrix should be sparser to find defective samples with only a small number of tests.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2019EDL8187/_p
부
@ARTICLE{e103-d_5_1164,
author={Jin-Taek SEONG, },
journal={IEICE TRANSACTIONS on Information},
title={A New Upper Bound for Finding Defective Samples in Group Testing},
year={2020},
volume={E103-D},
number={5},
pages={1164-1167},
abstract={The aim of this paper is to show an upper bound for finding defective samples in a group testing framework. To this end, we exploit minimization of Hamming weights in coding theory and define probability of error for our decoding scheme. We derive a new upper bound on the probability of error. We show that both upper and lower bounds coincide with each other at an optimal density ratio of a group matrix. We conclude that as defective rate increases, a group matrix should be sparser to find defective samples with only a small number of tests.},
keywords={},
doi={10.1587/transinf.2019EDL8187},
ISSN={1745-1361},
month={May},}
부
TY - JOUR
TI - A New Upper Bound for Finding Defective Samples in Group Testing
T2 - IEICE TRANSACTIONS on Information
SP - 1164
EP - 1167
AU - Jin-Taek SEONG
PY - 2020
DO - 10.1587/transinf.2019EDL8187
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E103-D
IS - 5
JA - IEICE TRANSACTIONS on Information
Y1 - May 2020
AB - The aim of this paper is to show an upper bound for finding defective samples in a group testing framework. To this end, we exploit minimization of Hamming weights in coding theory and define probability of error for our decoding scheme. We derive a new upper bound on the probability of error. We show that both upper and lower bounds coincide with each other at an optimal density ratio of a group matrix. We conclude that as defective rate increases, a group matrix should be sparser to find defective samples with only a small number of tests.
ER -