• Title/Summary/Keyword: Latin square

Search Result 429, Processing Time 0.021 seconds

Orthogonal Sudoku Square Designs with Block Effect Discrimination (블럭효과를 구별할 수 있는 직교스도쿠방격법)

  • Jang, Dae-Heung
    • The Korean Journal of Applied Statistics
    • /
    • v.24 no.3
    • /
    • pp.505-513
    • /
    • 2011
  • Sudoku is a famous Latin-square-based number-placement puzzle. Mo and Xu (2008) proposed Sudoku square designs based on the idea of Sudoku. Using several Sudoku square designs which are mutually orthogonal, we can suggest the orthogonal Sudoku square designs with block effect discrimination.

Efficient secret sharing scheme with cheater identification based on QR code

  • Huang, Peng-Cheng;Chang, Chin-Chen;Li, Yung-Hui;Liu, Yanjun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.10
    • /
    • pp.5144-5160
    • /
    • 2019
  • Secret sharing is an effective way of protecting secret messages. However, the traditional secret sharing schemes are considered meaningless due to malicious people attention which might raise risks. To overcome the weakness, this paper presents an effective secret sharing scheme with the functionality of cheater identification, based on meaningful QR code. The secret message will be split and concealed in the padding region of cover QR codes with the assistance of Latin square and it can be completely restored when all the involved participants cooperate. The concealing strategy exploits the characteristic of Reed-Solomon (RS) code to ensure the strong robustness of generated QR code pseudo-shares. The meaningful QR code pseudo-shares help to reduce the curious of unrelated persons. Some experiments were done to evaluate the performance of proposed scheme. The results showed that the proposed scheme is feasible, efficient and secure compared to the other existing schemes. It also achieves a higher secret payload and maintains stronger robustness.

Methods of generating Hopping Patterns Based on Permutation Frequency Hopping SSMA System (치환방법을 이용한 주파수 도약 확산 시스템의 주파수 도약 패턴 발생 방법)

  • Choon Sik YIM;Ryuji KOHNO;Hideki IMAI
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.16 no.12
    • /
    • pp.1357-1365
    • /
    • 1991
  • This paper proposes the generation of several classes of frequency hopping patterns. which are derived by permutation, for an asynchronous frequency hopping spread spectrum multiple accecss system (FH/SSMA). The first class of hopping patterns is obtained by using a Latin square. The second class of hopping patterns is derived by generalizing the first class which is designed by using a permutation technique. The third class of hopping patterns is designed by using a rotational base of elements. We evaluate the hit property of the proposed classes of hopping patterns when these patterns are nutually shifted in an FH/SSMA system. Compared to the Reed Slolmon sequences generated by the conventional method, the sequence obtained by the permutation technique can reduce the number of hits among hopping frequencies in asynchronous time/frequency shift.

  • PDF

The Design of Parallel Routing Algorithm on a Recursive Circulant Network (재귀원형군에서 병렬 경로 알고리즘의 설계)

  • Bae, Yong-Keun;Park, Byung-Kwon;Chung, Il-Yong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.11
    • /
    • pp.2701-2710
    • /
    • 1997
  • Recursive circulant graph has recently developed as a new model of multiprocessors, and drawn considerable attention to supercomputing, In this paper, we investigate the routing of a message i recursive circulant, that is a key to the performance of this network. On recursive circulant network, we would like to transmit m packets from a source node to a destination node simultaneously along paths, where the ith packet will traverse along the ith path $(o{\leq}i{\leq}m-1)$. In oder for all packets to arrive at the destination node quickly and securely, the ith path must be node-disjoint from all other paths. For construction of these paths, employing the Hamiltonian Circuit Latin Square(HCLS), a special class of $(n{\times}n)$ matrices, we present $O(n^2)$ parallel routing algorithm on recursive circulant network.

  • PDF

CONSTRUCTIONS OF REGULAR SPARSE ANTI-MAGIC SQUARES

  • Chen, Guangzhou;Li, Wen;Xin, Bangying;Zhong, Ming
    • Bulletin of the Korean Mathematical Society
    • /
    • v.59 no.3
    • /
    • pp.617-642
    • /
    • 2022
  • For positive integers n and d with d < n, an n × n array A based on 𝒳 = {0, 1, …, nd} is called a sparse anti-magic square of order n with density d, denoted by SAMS(n, d), if each non-zero element of X occurs exactly once in A, and its row-sums, column-sums and two main diagonal-sums constitute a set of 2n + 2 consecutive integers. An SAMS(n, d) is called regular if there are exactly d non-zero elements in each row, each column and each main diagonal. In this paper, we investigate the existence of regular sparse anti-magic squares of order n ≡ 1, 5 (mod 6), and prove that there exists a regular SAMS(n, d) for any n ≥ 5, n ≡ 1, 5 (mod 6) and d with 2 ≤ d ≤ n - 1.

COMPATIBILITY IN CERTAIN QUASIGROUP HOMOGENEOUS SPACE

  • Im, Bokhee;Ryu, Ji-Young
    • Bulletin of the Korean Mathematical Society
    • /
    • v.50 no.2
    • /
    • pp.667-674
    • /
    • 2013
  • Considering a special double-cover Q of the symmetric group of degree 3, we show that a proper non-regular approximate symmetry occurs from its quasigroup homogeneous space. The weak compatibility of any two elements of Q is completely characterized in any such quasigroup homogeneous space of degree 4.

Latin Square Type Partially Balanced Incomplete Block Designs

  • Paik, U.B.
    • Journal of the Korean Statistical Society
    • /
    • v.8 no.2
    • /
    • pp.125-130
    • /
    • 1979
  • It is well known that $L_2(m)$ type PBIB designs have the Property A, so they are BNAS PBIB designs. However, $L_3(m)$ type PBIB designs are not of type of Property A but do have the factorial structure (Cotter, John, and Smith(1973)). In this paper, the properties of the $L_3(m)$ type PBIB designs are investigated. Extended Property A and fractional BNAS are defined and a solution formula for the treatment effects in the $L_32(m)$ type designs is obtained.

  • PDF

Assessment and Interpretation of Bioequivalence for Two Drug Formulations using Crossover Design

  • Ko, Seoung-gon;Oh, Hyun-Sook
    • Communications for Statistical Applications and Methods
    • /
    • v.6 no.2
    • /
    • pp.601-610
    • /
    • 1999
  • Crossover design is officially except for special occasions recommended by KFDA and FDA for assessing Bioequivalence between two drugs one for reference and the other for innovator. Such design is regarded as a special case of latin square split-polt or repeated measurement design and its main difference with other designing methods is that each subject in an experiment is exposed two drugs in sequence. Therefore general statistical analysis is not suitable since the model for this experiment includes carryover effect in addition to period and sequence effect. in this paper analysis for crossover model with two drugs and its interpretation are mainly discussed and an example is given for illustration.

  • PDF