{"title":"构造具有良好汉明互相关性质序列族的代数方法","authors":"J.H. Mott","doi":"10.1109/SSST.1988.17068","DOIUrl":null,"url":null,"abstract":"A method of constructing families of sequences having reduced cross-correlation peaks is developed and demonstrated. This method, which is algebraic in nature, is easily applied to practical coding problems, such as that of finding spread-spectrum frequency-hopping patterns with reduced cross-correlation noise. The method is somewhat more flexible than the more standard group-theoretic approaches since it does not impose restrictions on sequence length, which those do.<<ETX>>","PeriodicalId":345412,"journal":{"name":"[1988] Proceedings. The Twentieth Southeastern Symposium on System Theory","volume":"672 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"An algebraic method for the construction of families of sequences with good Hamming cross-correlation properties\",\"authors\":\"J.H. Mott\",\"doi\":\"10.1109/SSST.1988.17068\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A method of constructing families of sequences having reduced cross-correlation peaks is developed and demonstrated. This method, which is algebraic in nature, is easily applied to practical coding problems, such as that of finding spread-spectrum frequency-hopping patterns with reduced cross-correlation noise. The method is somewhat more flexible than the more standard group-theoretic approaches since it does not impose restrictions on sequence length, which those do.<<ETX>>\",\"PeriodicalId\":345412,\"journal\":{\"name\":\"[1988] Proceedings. The Twentieth Southeastern Symposium on System Theory\",\"volume\":\"672 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-03-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1988] Proceedings. The Twentieth Southeastern Symposium on System Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SSST.1988.17068\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1988] Proceedings. The Twentieth Southeastern Symposium on System Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SSST.1988.17068","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An algebraic method for the construction of families of sequences with good Hamming cross-correlation properties
A method of constructing families of sequences having reduced cross-correlation peaks is developed and demonstrated. This method, which is algebraic in nature, is easily applied to practical coding problems, such as that of finding spread-spectrum frequency-hopping patterns with reduced cross-correlation noise. The method is somewhat more flexible than the more standard group-theoretic approaches since it does not impose restrictions on sequence length, which those do.<>