DocumentCode :
2051490
Title :
A method to construct elements of IdFin(2v+1) by using elements in IdFin(v)
Author :
Chuanqi Li ; Size Li
Author_Institution :
Dept. of Math., Beijing Jiaotong Univ., Beijing, China
fYear :
2011
fDate :
27-30 Nov. 2011
Firstpage :
369
Lastpage :
372
Abstract :
Latin squares have wide application in communication and cipher. Denote by IdFin(r) the set of all integer pairs (t, s) for which there exist three idempotent Latin squares of order v on the same set having fine structure (t, s). A method to construct elements of IdFin(2v+1) by using elements in IdFin(v) is presented.
Keywords :
cryptography; set theory; cipher; idempotent Latin squares; integer pairs; Latin square; Latin trade; fine structure; idempotent Latin squares;
fLanguage :
English
Publisher :
iet
Conference_Titel :
Wireless, Mobile & Multimedia Networks (ICWMMN 2011), 4th IET International Conference on
Conference_Location :
Beijing
Electronic_ISBN :
978-1-84919-507-2
Type :
conf
DOI :
10.1049/cp.2011.1026
Filename :
6197893
Link To Document :
بازگشت