Добірка наукової літератури з теми "Search of maximal codes"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Search of maximal codes".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Search of maximal codes"
WONG, SHUI-WAI. "AKITA: A CAREER COUNSELING CASE FOR PRACTICE AND THEORETICAL REFLECTION." Hong Kong Journal of Social Work 54, no. 01n02 (January 2020): 51–66. http://dx.doi.org/10.1142/s0219246220000066.
Повний текст джерелаAbideen, Ahmed Zainul, Jaafar Pyeman, Veera Pandiyan Kaliani Sundram, Ming-Lang Tseng, and Shahryar Sorooshian. "Leveraging Capabilities of Technology into a Circular Supply Chain to Build Circular Business Models: A State-of-the-Art Systematic Review." Sustainability 13, no. 16 (August 11, 2021): 8997. http://dx.doi.org/10.3390/su13168997.
Повний текст джерелаBruyère, Véronique, and Dominique Perrin. "Maximal bifix codes." Theoretical Computer Science 218, no. 1 (April 1999): 107–21. http://dx.doi.org/10.1016/s0304-3975(98)00253-9.
Повний текст джерелаAlderson, T. L., and A. A. Bruen. "Maximal AMDS codes." Applicable Algebra in Engineering, Communication and Computing 19, no. 2 (February 15, 2008): 87–98. http://dx.doi.org/10.1007/s00200-008-0058-0.
Повний текст джерелаMoulis, Guillaume, Maryse Lapeyre-Mestre, Jean-Louis Montastruc, Bertrand Godeau, and Laurent Sailler. "Vaccination Rates in Primary Immune Thrombocytopenia Adult Patients Exposed to Rituximab or Splenectomy. a Nationwide Population-Based Study in France." Blood 124, no. 21 (December 6, 2014): 2180. http://dx.doi.org/10.1182/blood.v124.21.2180.2180.
Повний текст джерелаBurderi, Fabio. "Monoids and Maximal Codes." Electronic Proceedings in Theoretical Computer Science 63 (August 17, 2011): 83–92. http://dx.doi.org/10.4204/eptcs.63.12.
Повний текст джерелаLam, Nguyen Huong. "Finite maximal solid codes." Theoretical Computer Science 262, no. 1-2 (July 2001): 333–47. http://dx.doi.org/10.1016/s0304-3975(00)00277-2.
Повний текст джерелаGuesnet, Yannick. "On maximal synchronous codes." Theoretical Computer Science 307, no. 1 (September 2003): 129–38. http://dx.doi.org/10.1016/s0304-3975(03)00097-5.
Повний текст джерелаFoldes, Stephan, and Navin Singhi. "On maximal instantaneous codes." Electronic Notes in Discrete Mathematics 27 (October 2006): 27–28. http://dx.doi.org/10.1016/j.endm.2006.08.040.
Повний текст джерелаLiu, Yun. "Compositions of maximal codes." Theoretical Computer Science 411, no. 1 (January 2010): 228–38. http://dx.doi.org/10.1016/j.tcs.2009.09.031.
Повний текст джерелаДисертації з теми "Search of maximal codes"
Кравчук, Володимир Вікторович. "Комплекс програм для визначення нероздільних завадостійких кодів". Bachelor's thesis, КПІ ім. Ігоря Сікорського, 2020. https://ela.kpi.ua/handle/123456789/35023.
Повний текст джерелаThe bachelors project includes an explanatory note (97 pages, 41 drawings, 7 annexes). In this work, the topics of error correction and error detection coding, finding maximal clique of graph have been researched. Different types of coding were considered, the problem of analytic speed of code was described and Bron-Kerbosh algorithm was analyzed. Based on specifics of equivalents codes and Hamming graph the methods of algorithm optimization for finding maximal undivided error correcting code were suggested. It has been decided to develop a complex of program which will help to calculate and research error correcting codes. The concrete requirements and functionality for the complex were formulated: possibility to search maximal undivided error correcting code according to parameters provided by user, stop work of complex in the moment with saving intermediate data algorithm are working with, loading the saved data and continue work after algorithm had been stopped, the possibility to perform some operations with codes like compute the minimal code distance, compute minimal code distance between a word and a code, sort code, provide simple and understandable graphical user interface for comfortable working with program. The complex of programs is implemented by Java programming language which is supported by all the most popular operation systems using native library JavaFX for developing graphical user interface.
Mumba, Nephtale Bvalamanja. "Codes, graphs and designs from maximal subgroups of alternating groups." University of the Western Cape, 2018. http://hdl.handle.net/11394/6165.
Повний текст джерелаThe main theme of this thesis is the construction of linear codes from adjacency matrices or sub-matrices of adjacency matrices of regular graphs. We first examine the binary codes from the row span of biadjacency matrices and their transposes for some classes of bipartite graphs. In this case we consider a sub-matrix of an adjacency matrix of a graph as the generator of the code. We then shift our attention to uniform subset graphs by exploring the automorphism groups of graph covers and some classes of uniform subset graphs. In the sequel, we explore equal codes from adjacency matrices of non-isomorphic uniform subset graphs and finally consider codes generated by an adjacency matrix formed by adding adjacency matrices of two classes of uniform subset graphs.
Guesnet, Yannick. "Codes et interprétations." Rouen, 2001. http://www.theses.fr/2001ROUES019.
Повний текст джерелаDhanasetty, Abhishek. "Enumerating Approximate Maximal Cliques in a Distributed Framework." University of Cincinnati / OhioLINK, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1617104719399743.
Повний текст джерелаBärmann, Daniel. "Aufzählen von DNA-Codes." Master's thesis, Universität Potsdam, 2006. http://opus.kobv.de/ubp/volltexte/2006/1026/.
Повний текст джерелаIn this work a model for enumerating DNA codes is developed. By applying an order on the set of DNA codewords and extending this order on the set of codes, this model assists in the discovery of DNA codes with properties like non-overlappingness, compliance, comma-freeness, sticky-freeness, overhang-freeness, subword-compliance, solidness and others with respect to a given involution on the set of codewords. This tool can be used to find codes with arbitrary combinations of code properties with respect to the standard Watson-Crick-DNA involution. The work also investigates DNA codes with respect to the optimizing of the information rate, as well as finding solid DNA codes.
Santos, Josenildo Brandão. "Construção de STBCs de Ordem Maximal em Álgebras Centrais Simples." Universidade Federal da Paraíba, 2012. http://tede.biblioteca.ufpb.br:8080/handle/tede/7404.
Повний текст джерелаCoordenação de Aperfeiçoamento de Pessoal de Nível Superior
In this dissertation, a way to build dense STBCs with full diversity of maximal order in central simple algebra will be presented. We constructed a retriculated ST code with a nonzero determinant for a quad antenna MISO transmission. Also, we will present a general algorithm to test the limit of a given order, since by the use of a maximum order instead of just the algebraic integer ring, we can increase the capacity of the code without a loss in the minimum determinant. Furthermore, by using the ideal of a maximum order we can further improve the code, as we increase the minimum determinant.
Nesta dissertação, será apresentada uma maneira para construir STBCs denso com diversidade completa, de ordem maximal em álgebras centrais simples. Construiremos um código reticulado ST com determinante não nulo para uma aplicação de quatro an- tenas de transmissão MISO. Apresentaremos também, um algoritmo geral para testar a maximalidade de uma ordem dada, uma vez que com o uso de uma ordem maximal em vez de apenas o anel dos inteiros algébricos, conseguimos um aumento na capacidade do código sem perda no determinante mínimo. Além disso, utilizando o ideal de uma ordem maximal melhoramos ainda mais o código, à medida que aumentamos o determinante mínimo.
Chi, Zhanjiang. "Performance Analysis of Maximal-Ratio Combining and Space-Time Block Codes with Transmit Antenna Selection over Nakagami-m Fading Channels." School of Electrical and Information Engineering, 2007. http://hdl.handle.net/2123/2012.
Повний текст джерелаThe latest wireless communication techniques such as highspeed wireless internet application demand higher data rates and better quality of service (QoS). However, transmission reliability is still degraded by harsh propagation channels. Multiple-input multiple-output (MIMO) systems can increase the system capacity and improve transmission reliability. By transmitting multiple copies of data, a MIMO system can effectively combat the effects of fading. Due to the high hardware cost of a MIMO system, antenna selection techniques have been applied in MIMO system design to reduce the system complexity and cost. The Nakagami-m distribution has been considered for MIMO channel modeling since a wide range of fading channels, from severe to moderate, can be modeled by using Nakagami-m distribution. The Rayleigh distribution is a special case of the Nakagami-m distribution. In this thesis, we analyze the error performance of two MIMO schemes: maximal-ratio combining with transmit antenna selection (the TAS/MRC scheme) and space-time block codes with transmit antenna selection (the TAS/STBC scheme) over Nakagami-m fading channels. In the TAS/MRC scheme, one of multiple transmit antennas, which maximizes the total received signal-to-noise ratio (SNR), is selected for uncoded data transmission. First we use a moment generating function based (MGF-based) approach to derive the bit error rate (BER) expressions for binary phase shift keying (BPSK), the symbol error rate (SER) expressions for M-ray phase shift keying (MPSK) and M-ray quadrature amplitude modulation (MQAM) of the TAS/MRC scheme over Nakagami-m fading channels with arbitrary and integer fading parameters m. The asymptotic performance is also investigated. It is revealed that the asymptotic diversity order is equal to the product of the Nakagami fading parameter m, the number of transmit antenna Lt and the number of receive antenna Lr as if all transmit antenna were used. Then a Gaussian Q-functions approach is used to investigate the error performance of the TAS/STBC scheme over Nakagami-m fading channels. In the TAS/STBC scheme, two transmit antennas, which maximize the output SNR, are selected for transmission. The exact and asymptotic BER expressions for BPSK are obtained for the TAS/STBC schemes with three and four transmit antennas. It is shown that the TAS/STBC scheme can provide a full diversity order of mLtLr.
Panagos, Adam G., and Kurt Kosbar. "A METHOD FOR FINDING BETTER SPACE-TIME CODES FOR MIMO CHANNELS." International Foundation for Telemetering, 2005. http://hdl.handle.net/10150/604782.
Повний текст джерелаMultiple-input multiple output (MIMO) communication systems can have dramatically higher throughput than single-input, single-output systems. Unfortunately, it can be difficult to find the space-time codes these systems need to achieve their potential. Previously published results located good codes by minimizing the maximum correlation between transmitted signals. This paper shows how this min-max method may produce sub-optimal codes. A new method which sorts codes based on the union bound of pairwise error probabilities is presented. This new technique can identify superior MIMO codes, providing higher system throughput without increasing the transmitted power or bandwidth requirements.
Xingyu, Luo, and Zhang Qishan. "A PARALLEL -SEQUENTIAL SEARCH ALGORITHM IN A HIGH DYNAMIC GPS RECEIVER." International Foundation for Telemetering, 2002. http://hdl.handle.net/10150/607533.
Повний текст джерелаIt is need to design acquisition and tracking for code loop and carrier loop to detect the high dynamic Global Position System (GPS) signal. Acquiring signal quickly and shortening acquisition time in the cold case are key technology of a high dynamic GPS receiver. Moreover, fast acquisition of C/A code is the base of code tracking and carrier acquisition and tracking. This paper describes elements and implementation of a new parallel-sequential search Algorithm to acquire C/A code of the high dynamic GPS signal. And combined with a 12-channel correlator named GP2021 produced by GEC Co., the arithmetic implementation to acquire C/A code of the high dynamic GPS signal used sequential search based on DSP technology is also given.
Chan, Evelyn Yu-San. "Heuristic optimisation for the minimum distance problem." Thesis, Nottingham Trent University, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.324569.
Повний текст джерелаКниги з теми "Search of maximal codes"
Nicholas, Ted. How to get your own trademark: Complete with trademark application forms, request for trademark search, federal regulations and codes, everything you need. Chicago, Ill: Enterprise-Dearborn, 1993.
Знайти повний текст джерелаOffice, Home. Draft codes of practice for the detention, treatment, questioning, and identification of persons by the police, for the searching of premises and seizure of property, and for the exercise of powers of stop and search. London: Home Office, 1985.
Знайти повний текст джерелаOntario. Human rights code, 1990: Rev. Statutes of Ontario, 1990, Chapter H.19, as amended by: 1993, ch. 27, sched.; 1993, ch.35,s.56; 1994, ch.10,s.22; 1994, ch.27,s.65; 1995, ch.4,s.3, and the following regulation (as amended): Search and entry warrants (R.R.O. 1990,Reg. 642) = Codes des droits de la personne : lois refondues de l'Ontario de 1990, chapitre H.19, tel qu'il est modifié par: l'annexe du chap. 27 de 1993; l'art. 56 du chap. 35 de 1993; l'art. 22 du chap. 10 de 1994; l'art. 65 du chap. 27 de 1994; l'art. 3 du chap. 4 de 1995, et le règlement suivant (tel qu'il est modifié): Mandat de perquisition et d'entrée (R.R.O. 1990, règl. 642). Toronto, Ont: Printed by the Queen's Printer for Ontario, 1996.
Знайти повний текст джерелаND, Robert J. Newton JD. In Search of the Hidden Codes of God in the Mathematics of Gematria: Discovering tbe True Da Vinci Code. Beyond the Bounds of Earth Publishing, 2018.
Знайти повний текст джерелаDraft codes of practice for the detention, treatment, questioning, and identification of persons by the police, for the searching of premises and seizure ... the exercise of powers of stop and search. Home Office, 1985.
Знайти повний текст джерелаPediatric ICD-10-CM 2018: A Manual for Provider-Based Coding. American Academy of Pediatrics, 2017. http://dx.doi.org/10.1542/9781610021074.
Повний текст джерелаParpworth, Neil. 19. Police powers. Oxford University Press, 2018. http://dx.doi.org/10.1093/he/9780198810704.003.0019.
Повний текст джерелаHawthorne, Nathaniel, and Cindy Weinstein. The Scarlet Letter. Edited by Brian Harding. Oxford University Press, 2008. http://dx.doi.org/10.1093/owc/9780199537808.001.0001.
Повний текст джерелаЧастини книг з теми "Search of maximal codes"
Bruyère, Véronique, and Michel Latteux. "Variable-length maximal codes." In Automata, Languages and Programming, 24–47. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61440-0_115.
Повний текст джерелаBoyvalenkov, Peter, and Ivan Landgev. "On maximal spherical codes I." In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 158–68. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-60114-7_12.
Повний текст джерелаFanali, Stefania. "On Linear Codes from Maximal Curves." In Cryptography and Coding, 91–111. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-10868-6_7.
Повний текст джерелаAnselmo, Marcella. "Constructing Finite Maximal Codes from Schützenberger Conjecture." In Lecture Notes in Computer Science, 197–214. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45446-2_13.
Повний текст джерелаDileep Reddy, M., and G. Sreenivasulu. "Performance of Rake Receiver for Maximal Codes." In Learning and Analytics in Intelligent Systems, 375–81. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-46943-6_42.
Повний текст джерелаAnselmo, Marcella, Dora Giammarresi, and Maria Madonia. "Encoding Pictures with Maximal Codes of Pictures." In SOFSEM 2018: Theory and Practice of Computer Science, 552–65. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-73117-9_39.
Повний текст джерелаBoyvalenkov, Peter, and Danyo Danev. "On maximal codes in polynomial metric spaces." In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 29–38. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-63163-1_3.
Повний текст джерелаGiorgetti, Marta. "Interesting Examples on Maximal Irreducible Goppa Codes." In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 215–18. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02181-7_23.
Повний текст джерелаGompert, Joel M. "Local Search with Maximal Independent Sets." In Principles and Practice of Constraint Programming – CP 2004, 795. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30201-8_74.
Повний текст джерелаKaveh, Ali, and Taha Bakhshpoori. "Cuckoo Search Algorithm." In Metaheuristics: Outlines, MATLAB Codes and Examples, 67–77. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-04067-3_7.
Повний текст джерелаТези доповідей конференцій з теми "Search of maximal codes"
Shen, Fumin, Wei Liu, Shaoting Zhang, Yang Yang, and Heng Tao Shen. "Learning Binary Codes for Maximum Inner Product Search." In 2015 IEEE International Conference on Computer Vision (ICCV). IEEE, 2015. http://dx.doi.org/10.1109/iccv.2015.472.
Повний текст джерелаHashemi, Seyyed Ali, Nghia Doan, Warren J. Gross, John Cioffi, and Andrea Goldsmith. "A Tree Search Approach for Maximum-Likelihood Decoding of Reed-Muller Codes." In 2021 IEEE Globecom Workshops (GC Wkshps). IEEE, 2021. http://dx.doi.org/10.1109/gcwkshps52748.2021.9682042.
Повний текст джерелаNafkha, Amor. "Near maximum likelihood detection algorithm based on 1-flip local search over uniformly distributed codes." In ICC 2013 - 2013 IEEE International Conference on Communications. IEEE, 2013. http://dx.doi.org/10.1109/icc.2013.6655353.
Повний текст джерелаLong, Dongyang, and Weijia Jia. "Optimal maximal and maximal prefix codes equivalent to Huffman codes." In Proceedings of ICASSP '02. IEEE, 2002. http://dx.doi.org/10.1109/icassp.2002.5745161.
Повний текст джерелаDongyang Long and Weijia Jia. "Optimal maximal and maximal prefix codes equivalent to Huffman codes." In IEEE International Conference on Acoustics Speech and Signal Processing ICASSP-02. IEEE, 2002. http://dx.doi.org/10.1109/icassp.2002.1005199.
Повний текст джерелаSabiri, Mohammed. "Maximal Codes for Finite Chain Rings." In 2019 International Conference on Advanced Communication Technologies and Networking (CommNet). IEEE, 2019. http://dx.doi.org/10.1109/commnet.2019.8742351.
Повний текст джерелаMakriyannis, Nikolaos, and Bertrand Meyer. "Some constructions of maximal witness codes." In 2011 IEEE International Symposium on Information Theory - ISIT. IEEE, 2011. http://dx.doi.org/10.1109/isit.2011.6033928.
Повний текст джерелаLv, Liangdong, Ruihu Li, Qiang Fu, and Xueliang Li. "Maximal entanglement entanglement-assisted quantum codes from quaternary BCH codes." In 2015 IEEE Advanced Information Technology, Electronic and Automation Control Conference (IAEAC). IEEE, 2015. http://dx.doi.org/10.1109/iaeac.2015.7428647.
Повний текст джерелаGao, Jie, Fei Hao, Geyong Min, and Zhipeng Cai. "Maximal Multipolarized Cliques Search in Signed Networks." In SIGIR '21: The 44th International ACM SIGIR Conference on Research and Development in Information Retrieval. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3404835.3463014.
Повний текст джерелаMedya, Sourav, Tiyani Ma, Arlei Silva, and Ambuj Singh. "A Game Theoretic Approach For Core Resilience." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/480.
Повний текст джерелаЗвіти організацій з теми "Search of maximal codes"
Landjev, Ivan, and Assia Rousseva. On the Maximal Cardinality of Binary Two-weight Codes. "Prof. Marin Drinov" Publishing House of Bulgarian Academy of Sciences, October 2021. http://dx.doi.org/10.7546/crabs.2021.10.01.
Повний текст джерелаPaulins, V. Ann, Julie L. Hillery, and Aaron Sturgill. Using Personal Mission Statements and Codes of Ethics as Career Search Tools. Ames: Iowa State University, Digital Repository, November 2015. http://dx.doi.org/10.31274/itaa_proceedings-180814-64.
Повний текст джерелаTrabia, M. B., M. Kiley, J. Cardle, and M. Joseph. Report on task assignment No. 3 for the Waste Package Project; Parts A & B, ASME pressure vessel codes review for waste package application; Part C, Library search for reliability/failure rates data on low temperature low pressure piping, containers, and casks with long design lives. Office of Scientific and Technical Information (OSTI), July 1991. http://dx.doi.org/10.2172/138422.
Повний текст джерелаElroy-Stein, Orna, and Dmitry Belostotsky. Mechanism of Internal Initiation of Translation in Plants. United States Department of Agriculture, December 2010. http://dx.doi.org/10.32747/2010.7696518.bard.
Повний текст джерелаNelson, Gena. Special Education Math Interventions. Boise State University, March 2021. http://dx.doi.org/10.18122/sped_facpubs/133/boisestate.
Повний текст джерела