Literatura científica selecionada sobre o tema "Projective code"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Índice
Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Projective code".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Artigos de revistas sobre o assunto "Projective code"
Abdulkareem Al-Zangana, Emad Bakr. "Projective MDS Codes Over GF(27)". Baghdad Science Journal 18, n.º 2(Suppl.) (20 de junho de 2021): 1125. http://dx.doi.org/10.21123/bsj.2021.18.2(suppl.).1125.
Texto completo da fonteLimbupasiriporn, J., L. Storme e P. Vandendriessche. "Large weight code words in projective space codes". Linear Algebra and its Applications 437, n.º 3 (agosto de 2012): 809–16. http://dx.doi.org/10.1016/j.laa.2012.03.024.
Texto completo da fonteGonzález Sarabia, Manuel, Carlos Rentería Márquez e Eliseo Sarmiento Rosales. "Projective parameterized linear codes". Analele Universitatii "Ovidius" Constanta - Seria Matematica 23, n.º 2 (1 de junho de 2015): 223–40. http://dx.doi.org/10.1515/auom-2015-0039.
Texto completo da fonteKurz, Sascha. "Non-Projective Two-Weight Codes". Entropy 26, n.º 4 (27 de março de 2024): 289. http://dx.doi.org/10.3390/e26040289.
Texto completo da fonteXie, Wenjiao, e Huisheng Zhang. "Patterned Reed–Muller Sequences with Outer A-Channel Codes and Projective Decoding for Slot-Controlled Unsourced Random Access". Sensors 23, n.º 11 (31 de maio de 2023): 5239. http://dx.doi.org/10.3390/s23115239.
Texto completo da fonteGonzález-Sarabia, Manuel, Delio Jaramillo e Rafael H. Villarreal. "On the generalized Hamming weights of certain Reed–Muller-type codes". Analele Universitatii "Ovidius" Constanta - Seria Matematica 28, n.º 1 (1 de março de 2020): 205–17. http://dx.doi.org/10.2478/auom-2020-0014.
Texto completo da fonteZubov, A. U. "Authentication code with secrecy based on projective geometry". Prikladnaya diskretnaya matematika, n.º 20 (1 de junho de 2013): 39–49. http://dx.doi.org/10.17223/20710410/20/5.
Texto completo da fonteXU, Xiaofan. "On Deep Holes of Projective Reed-Solomon Codes over Finite Fields with Even Characteristic". Wuhan University Journal of Natural Sciences 28, n.º 1 (fevereiro de 2023): 15–19. http://dx.doi.org/10.1051/wujns/2023281015.
Texto completo da fonteFareeq Fendi, Dunya, e Nada Yassen Kasm Yahya. "Construction of q-ary(n,M,d)-codes in PG(2,16)". Wasit Journal of Pure sciences 2, n.º 1 (26 de março de 2023): 111–30. http://dx.doi.org/10.31185/wjps.110.
Texto completo da fonteIbrahim, Dr Mohammed, e Islam. "Large (k,3)-arcs in PG(2,19) and the related linear codes". Journal of Kufa for Mathematics and Computer 11, n.º 1 (30 de março de 2024): 43–54. http://dx.doi.org/10.31642/jokmc/2018/110108.
Texto completo da fonteTeses / dissertações sobre o assunto "Projective code"
Qian, Liqin. "Contributions to the theory of algebraic coding on finite fields and rings and their applications". Electronic Thesis or Diss., Paris 8, 2022. http://www.theses.fr/2022PA080064.
Texto completo da fonteAlgebraic coding theory over finite fields and rings has always been an important research topic in information theory thanks to their various applications in secret sharing schemes, strongly regular graphs, authentication and communication codes.This thesis addresses several research topics according to the orientations in this context, whose construction methods are at the heart of our concerns. Specifically, we are interested in the constructions of optimal codebooks (or asymptotically optimal codebooks), the constructions of linear codes with a one-dimensional hull, the constructions of minimal codes, and the constructions of projective linear codes. The main contributions are summarized as follows. This thesis gives an explicit description of additive and multiplicative characters on finite rings (precisely _\mathbb{F}_q+u\mathbb{F}_q~(u^2= 0)s and S\mathbb{F}_q+u\mathbb{F}_q~(u^2=u)S), employees Gaussian, hyper Eisenstein and Jacobi sums and proposes several classes of optimal (or asymptotically optimal) new codebooks with flexible parameters. Next, it proposes(optimal or nearly optimal) linear codes with a one-dimensional hull over finite fields by employing tools from the theory of Gaussian sums. It develops an original method to construct these codes. It presents sufficient conditions for one-dimensional hull codes and a lower bound on its minimum distance. Besides, this thesis explores several classes of (optimal for the well-known Griesmer bound) binary linear codes over finite fields based on two generic constructions using functions. It determines their parameters and weight distributions and derives several infinite families of minimal linear codes. Finally, it studies (optimal for the sphere packing bound) constructions of several classes of projective binary linear codes with a few weight and their corresponding duals codes
Patraucean, Viorica. "Detection and identification of elliptical structure arrangements in images : theory and algorithms". Thesis, Toulouse, INPT, 2012. http://www.theses.fr/2012INPT0020/document.
Texto completo da fonteThis thesis deals with different aspects concerning the detection, fitting, and identification of elliptical features in digital images. We put the geometric feature detection in the a contrario statistical framework in order to obtain a combined parameter-free line segment, circular/elliptical arc detector, which controls the number of false detections. To improve the accuracy of the detected features, especially in cases of occluded circles/ellipses, a simple closed-form technique for conic fitting is introduced, which merges efficiently the algebraic distance with the gradient orientation. Identifying a configuration of coplanar circles in images through a discriminant signature usually requires the Euclidean reconstruction of the plane containing the circles. We propose an efficient signature computation method that bypasses the Euclidean reconstruction; it relies exclusively on invariant properties of the projective plane, being thus itself invariant under perspective
Caullery, Florian. "Polynomes sur les corps finis pour la cryptographie". Thesis, Aix-Marseille, 2014. http://www.theses.fr/2014AIXM4013/document.
Texto completo da fonteFunctions from F_q to itself are interesting objects arising in various domains such as cryptography, coding theory, finite geometry or algebraic geometry. It is well known that these functions admit a univariate polynomial representation. There exists many interesting classes of such polynomials with plenty of applications in pure or applied maths. We are interested in three of them: Almost Perfect Nonlinear (APN) polynomials, Planar (PN) polynomials and o-polynomials. APN polynomials are mostly used in cryptography to provide S-boxes with the best resistance to differential cryptanalysis and in coding theory to construct double error-correcting codes. PN polynomials and o-polynomials first appeared in finite geometry. They give rise respectively to projective planes and ovals in P^2(F_q). Also, their field of applications was recently extended to symmetric cryptography and error-correcting codes.A complete classification of APN, PN and o-polynomials is an interesting open problem that has been widely studied by many authors. A first approach toward the classification was to consider only power functions and the studies were recently extended to polynomial functions.One way to face the problem of the classification is to consider the polynomials that are APN, PN or o-polynomials over infinitely many extensions of F_q, namely, the exceptional APN, PN or o-polynomials.We improve the partial classification of exceptional APN and PN polynomials and give a full classification of exceptional o-polynomials. The proof technique is based on the Lang-Weil bound for the number of rational points in algebraic varieties together with elementary methods
Wong, Chee Heng. "Aerodynamic analysis of M33 projectile using the CFX code". Monterey, California. Naval Postgraduate School, 2011. http://hdl.handle.net/10945/10711.
Texto completo da fonteSt, George Julia. "Visual codes of secrecy photography of death and projective identification /". Access electronically, 2005. http://www.library.uow.edu.au/adt-NWU/public/adt-NWU20060608.143049/index.html.
Texto completo da fonteWu, Junhua. "Geometric structures and linear codes related to conics in classical projective planes of odd orders". Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file, 105 p, 2009. http://proquest.umi.com/pqdweb?did=1654490971&sid=2&Fmt=2&clientId=8331&RQT=309&VName=PQD.
Texto completo da fonteHuang, Jen-Fa. "On finding generator polynomials and parity-check sums of binary projective geometry codes". Thesis, University of Ottawa (Canada), 1985. http://hdl.handle.net/10393/4800.
Texto completo da fonteChu, Lei. "Colouring Cayley Graphs". Thesis, University of Waterloo, 2005. http://hdl.handle.net/10012/1125.
Texto completo da fontePassuello, Alberto. "Semidefinite programming in combinatorial optimization with applications to coding theory and geometry". Phd thesis, Université Sciences et Technologies - Bordeaux I, 2013. http://tel.archives-ouvertes.fr/tel-00948055.
Texto completo da fonteAlshawish, H. M. M. "3-D object classification using space-time coded light projection". Thesis, University of Newcastle Upon Tyne, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.336757.
Texto completo da fonteLivros sobre o assunto "Projective code"
Geological Survey (U.S.), ed. An AVS module to convert geographic coordinates to cartesian coordinates using map projection functions. St. Petersburg, FL: [U.S. Geological Survey, 1995.
Encontre o texto completo da fonteKnell, Edward J., e Mark P. Muñiz. Paleoindian lifeways of the Cody Complex. Salt Lake City: University of Utah Press, 2013.
Encontre o texto completo da fonteTu, Chyuan-Gen. Development of an adaptive grid generation code for projectile aerodynamics computation. 1985.
Encontre o texto completo da fonteTedlock, Dennis. The Olson Codex: Projective Verse and the Problem of Mayan Glyphs. University of New Mexico Press, 2017.
Encontre o texto completo da fonteMenotti, Gabriel, e Virginia Crisp, eds. Practices of Projection. Oxford University Press, 2020. http://dx.doi.org/10.1093/oso/9780190934118.001.0001.
Texto completo da fonteTeehan, John. Ethics, Secular and Religious. Editado por Phil Zuckerman e John R. Shook. Oxford University Press, 2017. http://dx.doi.org/10.1093/oxfordhb/9780199988457.013.40.
Texto completo da fonteJutz, Gabriele. Audiovisual Aesthetics in Contemporary Experimental Film. Editado por Yael Kaduri. Oxford University Press, 2016. http://dx.doi.org/10.1093/oxfordhb/9780199841547.013.10.
Texto completo da fonteWilliams, Gareth D. Activations of Landscape in De Aetna. Oxford University Press, 2017. http://dx.doi.org/10.1093/acprof:oso/9780190272296.003.0007.
Texto completo da fonteAzzouni, Jody. Constructing “Objects”. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780190622558.003.0011.
Texto completo da fonteKistler, John M. Animals in the Military. ABC-CLIO, LLC, 2011. http://dx.doi.org/10.5040/9798400613067.
Texto completo da fonteCapítulos de livros sobre o assunto "Projective code"
Eagle, Morris N. "Projective mode of cognition, projection as a defense, and projective identification". In Core Concepts in Contemporary Psychoanalysis, 124–73. Abingdon, Oxon ; New York, NY : Routledge, 2018. |: Routledge, 2017. http://dx.doi.org/10.4324/9781315142111-3.
Texto completo da fonteLachaud, Gilles. "Projective reed-muller codes". In Coding Theory and Applications, 125–29. Berlin, Heidelberg: Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/3-540-19368-5_13.
Texto completo da fonteJiang, Cheng, Yixuan Li, Shijie Feng, Yan Hu, Wei Yin, Jiaming Qian, Chao Zuo e Jinyang Liang. "Fringe Projection Profilometry". In Coded Optical Imaging, 241–86. Cham: Springer International Publishing, 2024. http://dx.doi.org/10.1007/978-3-031-39062-3_14.
Texto completo da fonteBerger, Thierry P., e Louis de Maximy. "Cyclic Projective Reed-Muller Codes". In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 77–81. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45624-4_8.
Texto completo da fonteCarpenter, Laurel L. "Oval Designs in Desarguesian Projective Planes". In Codes, Designs and Geometry, 47–55. Boston, MA: Springer US, 1996. http://dx.doi.org/10.1007/978-1-4613-1423-3_4.
Texto completo da fonteBierbrauer, Jürgen. "Three-dimensional codes and projective planes". In Introduction to Coding Theory, 125–30. Second edition. | Boca Raton : Taylor & Francis, 2017. | Series: Discrete mathematics and its applications | “A CRC title.”: Chapman and Hall/CRC, 2016. http://dx.doi.org/10.1201/9781315371993-11.
Texto completo da fonteLandjev, Ivan. "Spreads in Projective Hjelmslev Geometries". In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 186–94. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02181-7_20.
Texto completo da fonteGriera, Mercè, Josep Rifà e Llorenç Huguet. "On s-sum-sets and projective codes". In Algebraic Algorithms and Error-Correcting Codes, 135–42. Berlin, Heidelberg: Springer Berlin Heidelberg, 1986. http://dx.doi.org/10.1007/3-540-16776-5_716.
Texto completo da fonteAubry, Yves. "Reed-Muller codes associated to projective algebraic varieties". In Lecture Notes in Mathematics, 4–17. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/bfb0087988.
Texto completo da fonteBallet, Stéphane, e Bastien Pacifico. "Chudnovsky-Type Algorithms over the Projective Line Using Generalized Evaluation Maps". In Codes, Cryptology and Information Security, 360–75. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-33017-9_22.
Texto completo da fonteTrabalhos de conferências sobre o assunto "Projective code"
Nastasescu, M. M., e A. R. Calderbank. "The projective Kerdock code". In 2010 IEEE Information Theory Workshop (ITW 2010). IEEE, 2010. http://dx.doi.org/10.1109/cig.2010.5592761.
Texto completo da fonteEVANS, J., e A. WARDLAW. "Prediction of tubular projective aerodynamics using the ZEUS Euler code". In 27th Aerospace Sciences Meeting. Reston, Virigina: American Institute of Aeronautics and Astronautics, 1989. http://dx.doi.org/10.2514/6.1989-334.
Texto completo da fonteGhatak, Anirban. "A bound-achieving modified Etzion-Vardy (5, 3) projective space code". In 2016 Twenty Second National Conference on Communication (NCC). IEEE, 2016. http://dx.doi.org/10.1109/ncc.2016.7561182.
Texto completo da fonteAbdullah, Hajir, e Nada Yahya. "New Applications of Coding Theory in The Projective Space of Order Three". In 3rd International Conference of Mathematics and its Applications. Salahaddin University-Erbil, 2020. http://dx.doi.org/10.31972/ticma22.14.
Texto completo da fonteRamkumar, Vinayak, Myna Vajha e P. Vijay Kumar. "Determining the Generalized Hamming Weight Hierarchy of the Binary Projective Reed-Muller Code". In 2018 Twenty Fourth National Conference on Communications (NCC). IEEE, 2018. http://dx.doi.org/10.1109/ncc.2018.8600134.
Texto completo da fonteZhao, Sheng-Mei, Xiu-Li Zhu e Guo-Jun Sun. "A construction method of quantum low density parity check code based on projective geometry". In 2009 Fourth International Conference on Communications and Networking in China (CHINACOM). IEEE, 2009. http://dx.doi.org/10.1109/chinacom.2009.5339860.
Texto completo da fonteIzumida, Tomonori, Akira Mori e Masatomo Hashimoto. "Context-Sensitive Flow Graph and Projective Single Assignment Form for Resolving Context-Dependency of Binary Code". In CCS '18: 2018 ACM SIGSAC Conference on Computer and Communications Security. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3264820.3264826.
Texto completo da fonteZANG, LI-WEI, WEI-DONG SONG, BIN QIN e WEN-MIN YAN. "EFFECT ON PREMADE SEPARABLE LESS-PENETRATING PROJECTILE PENETRATING GELATIN TARGET". In 32ND INTERNATIONAL SYMPOSIUM ON BALLISTICS. Destech Publications, Inc., 2022. http://dx.doi.org/10.12783/ballistics22/36192.
Texto completo da fonteLI, JIN-MING, WEN-MIN YAN, SHU WANG, DA-BIN LU e RUI-MIN MAI. "EXPERIMENTAL INVESTIGATION ON PENETRATION OF MASONRY WALL BY LARGE CALIBER RIFLE BULLET". In 32ND INTERNATIONAL SYMPOSIUM ON BALLISTICS. Destech Publications, Inc., 2022. http://dx.doi.org/10.12783/ballistics22/36189.
Texto completo da fonteVajha, Myna, Vinayak Ramkumar e P. Vijay Kumar. "Binary, shortened projective reed muller codes for coded private information retrieval". In 2017 IEEE International Symposium on Information Theory (ISIT). IEEE, 2017. http://dx.doi.org/10.1109/isit.2017.8007009.
Texto completo da fonteRelatórios de organizações sobre o assunto "Projective code"
Singh, S., C. G. Blood e J. M. Zouris. Projection of Patient Condition Code Distributions for Naval Combat Deployments. Fort Belvoir, VA: Defense Technical Information Center, setembro de 1999. http://dx.doi.org/10.21236/ada374981.
Texto completo da fonteVerbrugge, Randal J., e Saeed Zaman. Post-COVID Inflation Dynamics: Higher for Longer. Federal Reserve Bank of Cleveland, janeiro de 2023. http://dx.doi.org/10.26509/frbc-wp-202306.
Texto completo da fonteCHRISTOPHER, THOMAS WOODS. Projection of the Cost-Effectiveness of PIMs for Particle Transport Codes. Office of Scientific and Technical Information (OSTI), junho de 2003. http://dx.doi.org/10.2172/820890.
Texto completo da fonteIlg, Mark. Multi-Core Computing Cluster for Safety Fan Analysis of Guided Projectiles. Fort Belvoir, VA: Defense Technical Information Center, setembro de 2011. http://dx.doi.org/10.21236/ada551790.
Texto completo da fonteMikhail, Ameer G. Assessment of Two Fast Codes used for Preliminary Aerodynamic Design of Guided Projectiles. Fort Belvoir, VA: Defense Technical Information Center, julho de 1986. http://dx.doi.org/10.21236/ada171276.
Texto completo da fonteClark, Todd E., Matthew V. Gordon e Saeed Zaman. Forecasting Core Inflation and Its Goods, Housing, and Supercore Components. Federal Reserve Bank of Cleveland, dezembro de 2023. http://dx.doi.org/10.26509/frbc-wp-202334.
Texto completo da fonteSparks, Paul, Jesse Sherburn, William Heard e Brett Williams. Penetration modeling of ultra‐high performance concrete using multiscale meshfree methods. Engineer Research and Development Center (U.S.), setembro de 2021. http://dx.doi.org/10.21079/11681/41963.
Texto completo da fonteCleary, Summers. Land Cover Summary Statistics for National Capital Region Park Units. National Park Service, 2024. http://dx.doi.org/10.36967/2301309.
Texto completo da fonteVargas-Herrera, Hernando, Juan Jose Ospina-Tejeiro, Carlos Alfonso Huertas-Campos, Adolfo León Cobo-Serna, Edgar Caicedo-García, Juan Pablo Cote-Barón, Nicolás Martínez-Cortés et al. Monetary Policy Report - April de 2021. Banco de la República de Colombia, julho de 2021. http://dx.doi.org/10.32468/inf-pol-mont-eng.tr2-2021.
Texto completo da fonteHeavenly Jade of the Maya. Inter-American Development Bank, novembro de 2012. http://dx.doi.org/10.18235/0006216.
Texto completo da fonte