Добірка наукової літератури з теми "Code distance"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Code distance".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Code distance"
Gabidulin, E. M., and N. I. Pilipchuk. "Multicomponent codes with maximum code distance." Problems of Information Transmission 52, no. 3 (July 2016): 276–83. http://dx.doi.org/10.1134/s0032946016030054.
Повний текст джерелаSoloviev, Alexander A., and Dmitry V. Chernikov. "Biorthogonal wavelet codes with prescribed code distance." Discrete Mathematics and Applications 28, no. 3 (June 26, 2018): 179–88. http://dx.doi.org/10.1515/dma-2018-0017.
Повний текст джерелаStepanov, S. A. "Nonlinear q-ary codes with large code distance." Problems of Information Transmission 53, no. 3 (April 4, 2017): 242–50. http://dx.doi.org/10.1134/s003294601703005x.
Повний текст джерелаHall, J. I., and J. H. van Lint. "Constant distance code pairs." Indagationes Mathematicae (Proceedings) 88, no. 1 (March 1985): 41–45. http://dx.doi.org/10.1016/s1385-7258(85)80018-4.
Повний текст джерелаOlivares, J., L. M. Sarro, H. Bouy, N. Miret-Roig, L. Casamiquela, P. A. B. Galli, A. Berihuete, and Y. Tarricq. "Kalkayotl: A cluster distance inference code." Astronomy & Astrophysics 644 (November 24, 2020): A7. http://dx.doi.org/10.1051/0004-6361/202037846.
Повний текст джерелаDelfosse, Nicolas, and Matthew B. Hastings. "Union-Find Decoders For Homological Product Codes." Quantum 5 (March 10, 2021): 406. http://dx.doi.org/10.22331/q-2021-03-10-406.
Повний текст джерелаHastings, Mathew B. "Weight reduction for quantum codes." Quantum Information and Computation 17, no. 15&16 (December 2017): 1307–34. http://dx.doi.org/10.26421/qic17.15-16-4.
Повний текст джерелаZhu, Bing. "Rethinking Fractional Repetition Codes: New Construction and Code Distance." IEEE Communications Letters 20, no. 2 (February 2016): 220–23. http://dx.doi.org/10.1109/lcomm.2015.2512871.
Повний текст джерелаNoguchi, Satoshi, Xiao-Nan Lu, Masakazu Jimbo, and Ying Miao. "BCH Codes with Minimum Distance Proportional to Code Length." SIAM Journal on Discrete Mathematics 35, no. 1 (January 2021): 179–93. http://dx.doi.org/10.1137/19m1260876.
Повний текст джерелаTalmale, Seema, Srija Unnikrishnan, and Bhaurao K. Lande. "Distance increasing mapping for variable distance block code." IET Communications 14, no. 9 (June 2, 2020): 1495–501. http://dx.doi.org/10.1049/iet-com.2019.0875.
Повний текст джерелаДисертації з теми "Code distance"
Ketkar, Avanti Ulhas. "Code constructions and code families for nonbinary quantum stabilizer code." Thesis, Texas A&M University, 2004. http://hdl.handle.net/1969.1/2743.
Повний текст джерелаMiller, John. "High code rate, low-density parity-check codes with guaranteed minimum distance and stopping weight /." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2003. http://wwwlib.umi.com/cr/ucsd/fullcit?p3090443.
Повний текст джерелаFilho, Nelson Whitaker. "Aircraft Distance Measurement System." International Foundation for Telemetering, 1994. http://hdl.handle.net/10150/611674.
Повний текст джерелаThe Aircraft Distance Measurement System (ADMS) could be used in Flight Test application to determine the aircraft position and speed during takeoff, landing and acceleration-stop performance test within runway limits using a microwave link.
Nordström, Markus. "Automatic Source Code Classification : Classifying Source Code for a Case-Based Reasoning System." Thesis, Mittuniversitetet, Avdelningen för informations- och kommunikationssystem, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-25519.
Повний текст джерелаRivas, Angel Esteban Labrador. "Coordination of distance and overcurrent relays using a mathematical optimization technique." Universidade Estadual de Londrina. Centro de Tecnologia e Urbanismo. Programa de Pós-Graduação em Engenharia Elétrica, 2018. http://www.bibliotecadigital.uel.br/document/?code=vtls000218372.
Повний текст джерелаProtection of power transmission has an important role in power systems. To improve protection is common to combine different types of relays, which combination of overcurrent and distance relays is a well-known protection scheme. A slow operational speed of overcurrent relay forces application of distance relay as the main protection device. Overcurrent relays are used as backup protection to main distance protection system. To achieve this aim, coordination between primary and backup protection systems should be performed developing an objective function with both parameters. Speed, selectivity, and stability are constraints, which must be satisfied by performing coordination. The coordination of directional overcurrent relays (DOCRs) problem is a nonlinear programming problem (NLP), usually solved with a linear programming technique (LP) only considering the time dial setting (TDS) as a decision variable, without dealing with the non-linear problem of plug setting (PS), or solving the PS component using a heuristic technique. A metaheuristic algorithm method presented to solve the optimization problem is an ant colony optimization (ACO) algorithm. The ACO used is an extension of the ACO algorithm for continuous domain optimization problems implemented to mixed variable optimization problems, condensed in two types of variables both continuous and categorical. In this work, both TDS and PS are decision variables, TDS is considered continuous and PS categorical. Normally, the initial solution is random generated, in addition, those results are compared by using the same random PS values for solving a relaxation of the DOCRs problem with LP to obtain new TDS values. Including distance relays in the formulation will add an additional variable continuous type, but with linear (barely constant) characteristics making no changes in DOCRs formulation for this NLP problem. For this methodology, five transmission systems (3, 6, 8, 9, and 15 Bus accordingly) were evaluated to compare classical DOCR coordination, distance relays introduction and model response to high-quality initial solutions within a hybrid method using LP.
Toste, Marisa Lapa. "Distance properties of convolutional codes over Z pr." Doctoral thesis, Universidade de Aveiro, 2016. http://hdl.handle.net/10773/17953.
Повний текст джерелаNesta tese consideramos códigos convolucionais sobre o anel polinomial [ ] r p ′ D , onde p é primo e r é um inteiro positivo. Em particular, focamo-nos no conjunto das palavras de código com suporte finito e estudamos as suas propriedades no que respeita às distâncias. Investigamos as duas propriedades mais importantes dos códigos convolucionais, nomeadamente, a distância livre e a distância de coluna. Começamos por analisar e solucionar o problema de, dado um conjunto de parâmetros, determinar a distância livre máxima possível que um código convolucional sobre [ ] r p ′ D pode atingir. Com efeito, obtemos um novo limite superior para esta distância generalizando os limites obtidos no contexto dos códigos convolucionais sobre corpos finitos. Além disso, mostramos que esse limite é ótimo, no sentido em que não pode ser melhorado. Para tal, apresentamos construções de códigos convolucionais (não necessariamente livres) que permitem atingir esse limite, para um certo conjunto de parâmetros. De acordo com a literatura chamamos a esses códigos MDS. Definimos também distâncias de coluna de um código convolucional. Obtemos limites superiores para as distâncias de coluna e chamamos MDP aos códigos cujas distâncias de coluna atingem estes limites superiores. Além disso, mostramos a existência de códigos MDP. Note-se, porém, que os códigos MDP apresentados não são completamente gerais pois os seus parâmetros devem satisfazer determinadas condições. Finalmente, estudamos o código dual de um código convolucional definido em (( )) r p ′ D . Os códigos duais de códigos convolucionais sobre corpos finitos foram exaustivamente investigados, como é refletido na literatura sobre o tema. Estes códigos são relevantes pois fornecem informação sobre a distribuição dos pesos do código e é neste sentido a inclusão deste assunto no âmbito desta tese. Outra razão importante para o estudo de códigos duais é a sua utilidade para o desenvolvimento de algoritmos de descodificação quando consideramos um erasure channel. Nesta tese são analisadas algumas propriedades fundamentais dos duais. Em particular, mostramos que códigos convolucionais definidos em (( )) r p ′ D admitem uma matriz de paridade. Para além disso, apresentamos um método construtivo para determinar um codificador de um código dual. keywords Convolutional codes, finite rings, free distance, column distance, MDS, MDP, dual code abstract In this thesis we consider convolutional codes over the polynomial ring [ ] r p ′ D , where p is a prime and r is a positive integer. In particular, we focus in the set of finite support codewords and study their distances properties. We investigate the two most important distance properties of convolutional codes, namely, the free distance and the column distance. First we address and fully solve the problem of determining the maximum possible free distance a convolutional code over [ ] r p ′ D can achieve, for a given set of parameters. Indeed, we derive a new upper bound on this distance generalizing the Singleton-type bounds derived in the context of convolutional codes over finite fields. Moreover, we show that such a bound is optimal in the sense that it cannot be improved. To do so we provide concrete constructions of convolutional codes (not necessarily free) that achieve this bound for any given set of parameters. In accordance with the literature we called such codes Maximum Distance Separable (MDS). We define the notion of column distance of a convolutional code. We obtain upper-bounds on the column distances and call Maximum Distance Profile (MDP) the codes that attain the maximum possible column distances. Furthermore, we show the existence of MDP codes. We note however that the MDP codes presented here are not completely general as their parameters need to satisfy certain conditions. Finally, we study the dual code of a convolutional code defined in (( )) r p ′ D . Dual codes of convolutional codes over finite fields have been thoroughly investigated as it is reflected in the large body of literature on this topic. They are relevant as they provide value information on the weight distribution of the code and therefore fit in the scope of this thesis. Another important reason for the study of dual codes is that they can be very useful for the development of decoding algorithms of convolutional codes over the erasure channel. In this thesis some fundamental properties have been analyzed. In particular, we show that convolutional codes defined in (( )) r p ′ D admit a parity-check matrix. Moreover, we
In this thesis we consider convolutional codes over the polynomial ring [ ] r p ′ D , where p is a prime and r is a positive integer. In particular, we focus in the set of finite support codewords and study their distances properties. We investigate the two most important distance properties of convolutional codes, namely, the free distance and the column distance. First we address and fully solve the problem of determining the maximum possible free distance a convolutional code over [ ] r p ′ D can achieve, for a given set of parameters. Indeed, we derive a new upper bound on this distance generalizing the Singleton-type bounds derived in the context of convolutional codes over finite fields. Moreover, we show that such a bound is optimal in the sense that it cannot be improved. To do so we provide concrete constructions of convolutional codes (not necessarily free) that achieve this bound for any given set of parameters. In accordance with the literature we called such codes Maximum Distance Separable (MDS). We define the notion of column distance of a convolutional code. We obtain upper-bounds on the column distances and call Maximum Distance Profile (MDP) the codes that attain the maximum possible column distances. Furthermore, we show the existence of MDP codes. We note however that the MDP codes presented here are not completely general as their parameters need to satisfy certain conditions. Finally, we study the dual code of a convolutional code defined in (( )) r p ′ D . Dual codes of convolutional codes over finite fields have been thoroughly investigated as it is reflected in the large body of literature on this topic. They are relevant as they provide value information on the weight distribution of the code and therefore fit in the scope of this thesis. Another important reason for the study of dual codes is that they can be very useful for the development of decoding algorithms of convolutional codes over the erasure channel. In this thesis some fundamental properties have been analyzed. In particular, we show that convolutional codes defined in (( )) r p ′ D admit a parity-check matrix. Moreover, we provide a constructive method to explicitly compute an encoder of the dual code.
Papadimitriou, Panayiotis D. "Code design based on metric-spectrum and applications." Texas A&M University, 2004. http://hdl.handle.net/1969.1/1365.
Повний текст джерелаKacan, Denis, and Darius Sidlauskas. "Information Visualization and Machine Learning Applied on Static Code Analysis." Thesis, Blekinge Tekniska Högskola, Avdelningen för programvarusystem, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-3033.
Повний текст джерелаMénéxiadis, Géraldine. "Détection à grande distance et localisation du supersonique "Concorde" à partir de signaux infrasonores." Phd thesis, Université de la Méditerranée - Aix-Marseille II, 2008. http://tel.archives-ouvertes.fr/tel-00487912.
Повний текст джерелаAbbara, Mamdouh. "Turbo-codes quantiques." Phd thesis, Ecole Polytechnique X, 2013. http://pastel.archives-ouvertes.fr/pastel-00842327.
Повний текст джерелаКниги з теми "Code distance"
Ai shen mi ma: Min jian nian hua zhong de qian li yin yuan = The code of the god of love : long distance romantic in new year pictures. Hangzhou Shi: Zhejiang gu ji chu ban she, 2011.
Знайти повний текст джерелаCoke stop in Emo: Adventures of a long-distance paddler. Toronto, Ont: Key Porter Books, 1995.
Знайти повний текст джерелаLizak, Pawel. Minimum distance bounds for linear codes over GF(3) and GF(4). Salford: University of Salford, 1992.
Знайти повний текст джерелаBullough, Edward. La distanza psichica come fattore artistico e principio estetico. [Palermo]: Centro internazionale studi di estetica, 1997.
Знайти повний текст джерелаKuznecov, Sergey, and Konstantin Rogozin. All of physics on your palm. Interactive reference. ru: INFRA-M Academic Publishing LLC., 2020. http://dx.doi.org/10.12737/501810.
Повний текст джерелаJernigan, Jack D. An investigation of the utility and accuracy of the table of speed and stopping distances specified in the Code of Virginia. Charlottesville, Va: Virginia Transportation Research Council, 2001.
Знайти повний текст джерелаDistant desire: Homoerotic codes and the subversion of the English novel in E.M. Forster's fiction. New York: P. Lang, 1996.
Знайти повний текст джерелаMario, Costa. L' estetica della comunicazione: Come il medium ha polverizzato il messaggio : sull'uso estetico della simultaneità a distanza. Roma: Castelvecchi, 1999.
Знайти повний текст джерелаMario, Costa. L' estetica della comunicazione: Come il medium ha polverizzato il messaggio : sull'uso estetico della simultaneità a distanza. Roma: Castelvecchi, 1999.
Знайти повний текст джерелаBadon, Cristina, ed. «Ti lascio con la penna, non col cuore». Lettere di Eleonora Rinuccini al marito Neri dei principi Corsini. 1835-1858. Florence: Firenze University Press, 2012. http://dx.doi.org/10.36253/978-88-6655-132-4.
Повний текст джерелаЧастини книг з теми "Code distance"
Weik, Martin H. "distance code." In Computer Science and Communications Dictionary, 439. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_5367.
Повний текст джерелаWeik, Martin H. "minimum distance code." In Computer Science and Communications Dictionary, 1022. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_11566.
Повний текст джерелаWeik, Martin H. "unit-distance code." In Computer Science and Communications Dictionary, 1863. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_20446.
Повний текст джерелаWeik, Martin H. "reflected binary unit distance code." In Computer Science and Communications Dictionary, 1445. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_15830.
Повний текст джерелаJu, Zhen-fei, Xiao-jiao Mao, Ning Li, and Yu-bin Yang. "Binary Code Learning via Iterative Distance Adjustment." In MultiMedia Modeling, 83–94. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-14445-0_8.
Повний текст джерелаEppler, Eva Duran. "The dependency distance hypothesis for bilingual code-switching." In Linguistik Aktuell/Linguistics Today, 183–206. Amsterdam: John Benjamins Publishing Company, 2014. http://dx.doi.org/10.1075/la.215.09dur.
Повний текст джерелаReichardt, Ben W. "Fault-Tolerance Threshold for a Distance-Three Quantum Code." In Automata, Languages and Programming, 50–61. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11786986_6.
Повний текст джерелаSun, Feng-Wen, and Henk C. A. Tilborg. "Fast Bounded-Distance Decoding of the Nordstrom-Robinson Code." In Communications and Cryptography, 391–98. Boston, MA: Springer US, 1994. http://dx.doi.org/10.1007/978-1-4615-2694-0_38.
Повний текст джерелаJégou, Yvon. "Performance Analysis of Code Coupling on Long Distance High Bandwidth Network." In Euro-Par 2002 Parallel Processing, 753–56. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45706-2_105.
Повний текст джерелаAmrani, Ofer, Yair Be'ery, and Alexander Vardy. "Bounded-distance decoding of the Leech lattice and the Golay code." In Algebraic Coding, 236–48. Berlin, Heidelberg: Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/3-540-57843-9_24.
Повний текст джерелаТези доповідей конференцій з теми "Code distance"
Adzhemov, A. S. "Code Distance Table and its Application." In 2018 Wave Electronics and its Application in Information and Telecommunication Systems (WECONF). IEEE, 2018. http://dx.doi.org/10.1109/weconf.2018.8604435.
Повний текст джерелаFrench, C. A. "Distance preserving run-length limited code." In International Magnetics Conference. IEEE, 1989. http://dx.doi.org/10.1109/intmag.1989.690317.
Повний текст джерелаZhilin, Igor, Alexey Kreshchuk, and Victor Zyablov. "On the code distance of a woven block code construction." In 2017 IEEE International Symposium on Information Theory (ISIT). IEEE, 2017. http://dx.doi.org/10.1109/isit.2017.8006481.
Повний текст джерелаSvetlov, Michael S., Alexey A. Lvov, Dmitry V. Klenov, Igor S. Bagaev, and Marina K. Svetlova. "Inter-symbol Distance Generated by Code with Code Signal Feature." In 2020 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (EIConRus). IEEE, 2020. http://dx.doi.org/10.1109/eiconrus49466.2020.9039035.
Повний текст джерелаZhang, Lei, Yongdong Zhang, Jinhu Tang, Ke Lu, and Qi Tian. "Binary Code Ranking with Weighted Hamming Distance." In 2013 IEEE Conference on Computer Vision and Pattern Recognition (CVPR). IEEE, 2013. http://dx.doi.org/10.1109/cvpr.2013.208.
Повний текст джерелаDehkordi, Arezou Banitalebi, and Syed A. R. Abu-Bakar. "Iris code matching using adaptive Hamming distance." In 2015 IEEE International Conference on Signal and Image Processing Applications (ICSIPA). IEEE, 2015. http://dx.doi.org/10.1109/icsipa.2015.7412224.
Повний текст джерелаLin, Zeqi, Junfeng Zhao, Yanzhen Zou, and Bing Xie. "Document Distance Estimation via Code Graph Embedding." In Internetware'17: The Eighth Asia-Pacific Symposium on Internetware. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3131704.3131713.
Повний текст джерелаDziabiola, Marta, Robert Steiner, Ralf Vetter, Daniel Norskov, and Dorothé Smit. "Qude: Exploring Tactile Code in Long-Distance Relationships." In TEI '22: Sixteenth International Conference on Tangible, Embedded, and Embodied Interaction. New York, NY, USA: ACM, 2022. http://dx.doi.org/10.1145/3490149.3505583.
Повний текст джерелаZhang, Xiangyu, Armand Navabi, and Suresh Jagannathan. "Alchemist: A Transparent Dependence Distance Profiling Infrastructure." In 2009 7th Annual IEEE/ACM International Symposium on Code Generation and Optimization (CGO). IEEE, 2009. http://dx.doi.org/10.1109/cgo.2009.15.
Повний текст джерелаLyu, Chong Woon, Bang Chul Jung, Sung Ho Moon, and Dan Keun Sung. "Distance-Based Code-Collision Control Scheme Using Erasure Decoding in Orthogonal Code Hopping Multiplexing." In The 9th International Conference on Advanced Communication Technology. IEEE, 2007. http://dx.doi.org/10.1109/icact.2007.358539.
Повний текст джерелаЗвіти організацій з теми "Code distance"
McCaffrey, Trevor, and Gordon T. Richards. CIV Distance. GitHub, October 2021. http://dx.doi.org/10.17918/civdistance.
Повний текст джерелаLaChance, Jeffrey L., William G. Houf, Larry Fluer, and Bobby Middleton. Analyses to support development of risk-informed separation distances for hydrogen codes and standards. Office of Scientific and Technical Information (OSTI), March 2009. http://dx.doi.org/10.2172/983689.
Повний текст джерелаMosiane, Ngaka, and Jennifer Murray. Economic and commuting connections in the northern GCR. Gauteng City-Region Observatory, February 2022. http://dx.doi.org/10.36634/tdlt5932.
Повний текст джерелаDíaz de Astarloa, Bernardo, Nanno Mulder, Sandra Corcuera-Santamaría, Winfried Weck, Lucas Barreiros, Rodrigo Contreras Huerta, and Alejandro Puente. Post Pandemic Covid-19 Economic Recovery: Enabling Latin America and the Caribbean to Better Harness E-commerce and Digital Trade. Edited by Marcee Gómez. Inter-American Development Bank, August 2021. http://dx.doi.org/10.18235/0003436.
Повний текст джерелаSavchenko, Sergii V., Svitlana O. Shekhavtsova, and Vladimir I. Zaselskiy. The development of students' critical thinking in the context of information security. [б. в.], November 2020. http://dx.doi.org/10.31812/123456789/4420.
Повний текст джерелаFarahbod, A. M., and J. F. Cassidy. An overview of seismic attenuation in the Northern Appalachians Seismic Zone, New Brunswick and Nova Scotia. Natural Resources Canada/CMSS/Information Management, 2022. http://dx.doi.org/10.4095/329702.
Повний текст джерелаGrumet, Rebecca, and Benjamin Raccah. Identification of Potyviral Domains Controlling Systemic Infection, Host Range and Aphid Transmission. United States Department of Agriculture, July 2000. http://dx.doi.org/10.32747/2000.7695842.bard.
Повний текст джерелаGur, Amit, Edward Buckler, Joseph Burger, Yaakov Tadmor, and Iftach Klapp. Characterization of genetic variation and yield heterosis in Cucumis melo. United States Department of Agriculture, January 2016. http://dx.doi.org/10.32747/2016.7600047.bard.
Повний текст джерелаAlchanatis, Victor, Stephen W. Searcy, Moshe Meron, W. Lee, G. Y. Li, and A. Ben Porath. Prediction of Nitrogen Stress Using Reflectance Techniques. United States Department of Agriculture, November 2001. http://dx.doi.org/10.32747/2001.7580664.bard.
Повний текст джерелаPrusky, Dov, Nancy P. Keller, and Amir Sherman. global regulation of mycotoxin accumulation during pathogenicity of Penicillium expansum in postharvest fruits. United States Department of Agriculture, January 2014. http://dx.doi.org/10.32747/2014.7600012.bard.
Повний текст джерела