Log in

Relevant bibliographies by topics / Computer programming. Coding theory

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Computer programming. Coding theory'

Author: Grafiati

Published: 4 June 2021

Last updated: 13 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Computer programming. Coding theory.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Computer programming. Coding theory"

1

Chang, Yaw O., and John K. Karlof. "Large scale geometric programming: An application in coding theory." Computers & Operations Research 21, no. 7 (August 1994): 747–55. http://dx.doi.org/10.1016/0305-0548(94)90004-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

CHLAMTÁČ, EDEN, and ISHAY HAVIV. "Linear Index Coding via Semidefinite Programming." Combinatorics, Probability and Computing 23, no. 2 (November 29, 2013): 223–47. http://dx.doi.org/10.1017/s0963548313000564.

Full text

Abstract:

In theindex codingproblem, introduced by Birk and Kol (INFOCOM, 1998), the goal is to broadcast ann-bit word tonreceivers (one bit per receiver), where the receivers haveside informationrepresented by a graphG. The objective is to minimize the length of a codeword sent to all receivers which allows each receiver to learn its bit. Forlinearindex coding, the minimum possible length is known to be equal to a graph parameter calledminrank(Bar-Yossef, Birk, Jayram and Kol,IEEE Trans. Inform. Theory, 2011).We show a polynomial-time algorithm that, given ann-vertex graphGwith minrankk, finds a linear index code forGof lengthÕ(nf(k)), wheref(k) depends only onk. For example, fork= 3 we obtainf(3) ≈ 0.2574. Our algorithm employs a semidefinite program (SDP) introduced by Karger, Motwani and Sudan for graph colouring (J. Assoc. Comput. Mach., 1998) and its refined analysis due to Arora, Chlamtac and Charikar (STOC, 2006). Since the SDP we use is not a relaxation of the minimization problem we consider, a crucial component of our analysis is anupper boundon the objective value of the SDP in terms of the minrank.At the heart of our analysis lies a combinatorial result which may be of independent interest. Namely, we show an exact expression for the maximum possible value of the Lovász ϑ-function of a graph with minrankk. This yields a tight gap between two classical upper bounds on the Shannon capacity of a graph.

APA, Harvard, Vancouver, ISO, and other styles

3

Zeilinger, Martin. "Live Coding the Law: Improvisation, Code, and Copyright." Computer Music Journal 38, no. 1 (March 2014): 77–89. http://dx.doi.org/10.1162/comj_a_00231.

Full text

Abstract:

This article concerns the emerging creative practice of live coding (i.e., the real-time programming of electronic music in text-based programming environments), and explores how this practice can be deployed as a tactic of resistance against the overreach of restrictive intellectual property policy. I begin by surveying definitions of copyright and patent law, and related issues, to situate live coding in the field of existing perspectives on cultural ownership. Drawing on legal theory and critical discourse on improvised music in other genres, I then argue that the dynamic, palimpsestic, and improvisational qualities of live coding contradict many of copyright law's core assumptions regarding the nature of “fixed” works of art. These contradictions can be usefully mobilized for the purpose of resisting legal and economic enclosures of the digital cultural commons. As I conclude, live coding can, from its current, inherently ambivalent position on copyright matters, develop a strong, performance-based critical stance against the imbalances and shortcomings of intellectual property regimes and outdated notions of exclusive cultural ownership. Integrating artistic practices with ongoing and emerging critiques of intellectual property, such resistance can go a long way towards highlighting readily available opportunities to oppose and confound the law.

APA, Harvard, Vancouver, ISO, and other styles

4

Lyon, Louise Ann, and Emily Green. "Coding Boot Camps." ACM Transactions on Computing Education 21, no. 2 (June 2021): 1–30. http://dx.doi.org/10.1145/3440891.

Full text

Abstract:

College-educated women in the workforce are discovering a latent interest in and aptitude for computing motivated by the prevalence of computing as an integral part of jobs in many fields as well as continued headlines about the number of unfilled, highly paid computing jobs. One of these women's choices for retraining are the so-called coding boot camps that teach programming skills through intensive multi-week courses. This article reports on a qualitative research study focused on the Silicon Valley area of California. We used social cognitive career theory (SCCT) to investigate the larger context surrounding women entering computing professions through boot camp learning sites, including: the environment of a booming technology workforce, boot camps as learning settings , the characteristics of women who attend boot camps, how retraining at a coding boot camp influence women's computing self-efficacy and outcome expectations , and the performance attainments of women at boot camps. Interview data was collected from 14 women who had attended boot camps—first before graduating from the boot camp and again after six months in the workforce. To contextualize the computing ecosystem, we conducted single interviews with 6 boot camp organizers/curriculum developers, 7 industry hiring managers, and 14 university computer science faculty. To provide a contrast with women at boot camps, we interviewed 5 women who majored in computer science at the university and with 17 men who had attended boot camps. Structural data coding and analysis was done focused on the SCCT mechanisms of environment, person inputs, learning experiences, self-efficacy, outcome expectations, and performance attainments. Findings here demonstrate that training at a boot camp can be the catalyst for college-educated women to attain computing jobs and careers, although these entry-level jobs may be a compromise to the goal of a software development job and are unlikely to lead to a job at large, well-known, established technology companies.

APA, Harvard, Vancouver, ISO, and other styles

5

Kosasih, P. B. "Learning Finite Element Methods by Building Applications." International Journal of Mechanical Engineering Education 38, no. 2 (April 2010): 167–84. http://dx.doi.org/10.7227/ijmee.38.2.7.

Full text

Abstract:

This paper describes how programming projects are used to help students understand the theory of finite element (FE) methods in the author's class. The implementation of FE theory in FE-based commercial software is made clearer through programming simple FE analysis codes. From the experience gained in the coding, students have a better understanding of the theory and numerical processes used in FE commercial software. As a result, they have more confidence in using commercial software, knowing that the computer programs are not simply ‘black boxes’ that process data and produce colourful results. More importantly, they understand the limitations of the programs, how to use them correctly and interpret the generated output correctly. Two projects are described in which students develop codes and then compare the results with those from commercial software.

APA, Harvard, Vancouver, ISO, and other styles

6

Chung, Chih-Chao, and Shi-Jer Lou. "Physical Computing Strategy to Support Students’ Coding Literacy: An Educational Experiment with Arduino Boards." Applied Sciences 11, no. 4 (February 19, 2021): 1830. http://dx.doi.org/10.3390/app11041830.

Full text

Abstract:

The purpose of this study is to explore the influence of introduction of the physical computing strategy of Arduino Boards in a program design course on coding literacy and the effectiveness of the application in technical high school students. This study selected two classes of twelfth-grade students enrolled in a program design course at a technical high school in Southern Taiwan as the samples. One class was the control group (43 students), and the other was the experimental group (42 students). During the 18-week course, the control group carried out a DBL (design-based learning) programming project, and the experimental group carried out the DBL programming project using the physical computing strategy of Arduino boards. Pre- and posttests and a questionnaire survey were carried out, while ANCOVA (analysis of covariance) was used for evaluation purposes. In the course, students in the experimental group were randomly selected for semi-structured interviews to understand their learning status and to perform qualitative analysis and summarization. This study proposed the physical computing strategy of Arduino boards, featuring staged teaching content, practical teaching activities, and real themes and problem-solving tasks. The results show that the coding literacy of students in the different teaching strategy groups was significantly improved. However, in the Arduino course on DBL programming, the students in the experimental group had a significantly higher learning efficiency in coding literacy than those in the control group. Moreover, according to the qualitative analysis using student interviews, Arduino boards were found to improve students’ motivation to learn coding and to aid in systematically guiding students toward improving their coding literacy by combining their learning with DBL theory. Thus, Arduino technology can be effectively used to improve students’ programming abilities and their operational thinking in practically applying programming theories.

APA, Harvard, Vancouver, ISO, and other styles

7

Oz, Furkan, and Kursat Kara. "A CFD Tutorial in Julia: Introduction to Laminar Boundary-Layer Theory." Fluids 6, no. 6 (June 3, 2021): 207. http://dx.doi.org/10.3390/fluids6060207.

Full text

Abstract:

Numerical simulations of laminar boundary-layer equations are used to investigate the origins of skin-friction drag, flow separation, and aerodynamic heating concepts in advanced undergraduate- and graduate-level fluid dynamics/aerodynamics courses. A boundary-layer is a thin layer of fluid near a solid surface, and viscous effects dominate it. Students must understand the modeling of flow physics and implement numerical methods to conduct successful simulations. Writing computer codes to solve equations numerically is a critical part of the simulation process. Julia is a new programming language that is designed to combine performance and productivity. It is dynamic and fast. However, it is crucial to understand the capabilities of a new programming language before attempting to use it in a new project. In this paper, fundamental flow problems such as Blasius, Hiemenz, Homann, and Falkner-Skan flow equations are derived from scratch and numerically solved using the Julia language. We used the finite difference scheme to discretize the governing equations, employed the Thomas algorithm to solve the resulting linear system, and compared the results with the published data. In addition, we released the Julia codes in GitHub to shorten the learning curve for new users and discussed the advantages of Julia over other programming languages. We found that the Julia language has significant advantages in productivity over other coding languages. Interested readers may access the Julia codes on our GitHub page.

APA, Harvard, Vancouver, ISO, and other styles

8

Lee, Younhee, Qi Lu, and Woong Lim. "An Application of Mathematics to Computer Programming: Connecting Translation Vectors, the Minkowski Difference, and Collision Detection." Mathematics Teacher 112, no. 2 (October 2018): 150–55. http://dx.doi.org/10.5951/mathteacher.112.2.0150.

Full text

Abstract:

Translation by a vector in the coordinate plane is first introduced in precalculus and connects to the basic theory of vector spaces in linear algebra. In this article, we explore the topic of collision detection in which the idea of a translation vector plays a significant role. Because collision detection has various applications in video games, virtual simulations, and robotics (Garcia-Alonso, Serrano, and Flaquer 1994; Rodrigue 2012), using it as a motivator in the study of translation vectors can be helpful. For example, students might be interested in the question, “How does the computer recognize when a player's character gets hit by a fireball?” Computer science provides a rich context for real-life applications of mathematics-programmers use mathematics for coding an algorithm in which the computer recognizes two objects nearing each other or colliding. The Minkowski difference, named after the nineteenth century German mathematician Hermann Minkowski, is used to solve collision detection problems (Ericson 2004). Applying the Minkowski difference to collision detection is based on translation vectors, and programmers use the algorithm as a method for detecting collision in video games.

APA, Harvard, Vancouver, ISO, and other styles

9

Cavalcanti Bueno, Andre Luis, Noemi de La Rocque Rodriguez, and Elisa Dominguez Sotelino. "An adaptive methodology for multi-GPU programming in OpenCL." Engineering Computations 34, no. 4 (June 12, 2017): 1277–92. http://dx.doi.org/10.1108/ec-12-2015-0392.

Full text

Abstract:

Purpose The purpose of this work is to present a methodology that harnesses the computational power of multiple graphics processing units (GPUs) and hides the complexities of tuning GPU parameters from the users. Design/methodology/approach A methodology for auto-tuning OpenCL configuration parameters has been developed. Findings This described process helps simplify coding and generates a significant gain in time for each method execution. Originality/value Most authors develop their GPU applications for specific hardware configurations. In this work, a solution is offered to make the developed code portable to any GPU hardware.

APA, Harvard, Vancouver, ISO, and other styles

10

KOHRING, G. A. "PARALLELIZATION OF SHORT- AND LONG-RANGE CELLULAR AUTOMATA ON SCALAR, VECTOR, SIMD AND MIMD MACHINES." International Journal of Modern Physics C 02, no. 03 (September 1991): 755–72. http://dx.doi.org/10.1142/s0129183191000986.

Full text

Abstract:

Algorithms exhibiting parallelization on many different levels are discussed for short-and long-range cellular automata implemented on scalar, vector, SIMD and MIMD machines. Short range cellular automata are commonly used for simulating hydrodynamic fluid flows, while long range cellular automata are applicable to neural networks at zero temperature. A common programming approach based upon multi-spin coding and including higher levels of parallelization when possible, has been used to implement these models on the SUN SPARC-1, the IBM-3090, the Alliant FX/2800, the NEC-SX3/11, the Cray-YMP/832 and the Connection Machine, CM-2. Section 4 of the paper compares the performance of these computers for the algorithms discussed in the text. Additionally, the major subroutines for each computer type are given in the Appendix.

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Computer programming. Coding theory"

1

Yan, Yun. "Turbo codes." Ohio : Ohio University, 1999. http://www.ohiolink.edu/etd/view.cgi?ohiou1175200238.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Li, Xiaolong. "Real-time speaker-independent large vocabulary continuous speech recoginition." Diss., Columbia, Mo. : University of Missouri-Columbia, 2005. http://hdl.handle.net/10355/4119.

Full text

Abstract:

Thesis (Ph. D.)--University of Missouri-Columbia, 2005.
The entire dissertation/thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file (which also appears in the research.pdf); a non-technical general description, or public abstract, appears in the public.pdf file. Title from title screen of research.pdf file viewed on (November 13, 2006) Vita. Includes bibliographical references.

APA, Harvard, Vancouver, ISO, and other styles

3

Dunscombe, Elizabeth Jane. "Some applications of mathematics to coding theory." Thesis, Royal Holloway, University of London, 1988. http://repository.royalholloway.ac.uk/items/a101f1a7-d892-4307-85c4-311c422cdb01/1/.

Full text

Abstract:

This thesis deals with the transmission of data over a channel that is subject to noise, or interference. There are many different methods of trying to achieve reliable communication of data in the presence of noise. This thesis considers some of these methods, in particular, those aspects involving the use of error-correcting codes. A number of specific applications are considered, as well as some more general theory. One general class of codes is that of cyclic codes (where every cyclic shift of a codeword is also a codeword). Chapter 2 of this thesis reviews a decoding scheme for cyclic codes proposed by Professor P.M. Cohn. The scheme is a modification of standard array syndrome decoding. It is shown that Cohn's scheme does not perform as well as the original version of syndrome decoding. Chapter 3 considers Cyclotomically Shortened Reed Solomon codes (a class of codes introduced by J.L. Dornstetter) and their relationship with the Chinese Remainder Theorem codes of J.J. Stone. The blocklength and dimension of these codes is established, together with the best possible lower bound on the minimum distance. The notion of cyclotomic shortening is then extended to Alternant codes. Chapter 4 deals with the subject of interleaving for channels that are subject to bursts of errors. An optimal solution is given to a problem posed by Inmarsat when interleaving is used with a convolutional code. It is shown how to improve the method of interleaving which feeds data column-wise into an array and then transmits row-wise, by careful selection of the order in which the rows are transmitted. The final chapter discusses the concept of an error-correcting code with two different codeword lengths. Some general results about such codes are presented. A method of forming these codes is given for the case when one word length is twice the other. A specific example of this type of code is considered. Both theoretical and simulated performance results are presented for the example.

APA, Harvard, Vancouver, ISO, and other styles

4

Passuello, 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.

Full text

Abstract:

We apply the semidefinite programming method to obtain a new upper bound on the cardinality of codes made of subspaces of a linear vector space over a finite field. Such codes are of interest in network coding.Next, with the same method, we prove an upper bound on the cardinality of sets avoiding one distance in the Johnson space, which is essentially Schrijver semidefinite program. This bound is used to improve existing results on the measurable chromatic number of the Euclidean space.We build a new hierarchy of semidefinite programs whose optimal values give upper bounds on the independence number of a graph. This hierarchy is based on matrices arising from simplicial complexes. We show some properties that our hierarchy shares with other classical ones. As an example, we show its application to the problem of determining the independence number of Paley graphs.

APA, Harvard, Vancouver, ISO, and other styles

5

Taha, Walid. "Multi-Stage Programming : Its Theory and Applications." Doctoral thesis, Oregon Graduate Institute of Science and Technology, 1999. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-15052.

Full text

Abstract:

MetaML is a statically typed functional programming language with special support for programgeneration. In addition to providing the standard features of contemporary programminglanguages such as Standard ML, MetaML provides three staging annotations. These staging annotationsallow the construction, combination, and execution of object-programs.Our thesis is that MetaML's three staging annotations provide a useful, theoretically soundbasis for building program generators. This dissertation reports on our study of MetaML's stagingconstructs, their use, their implementation, and their formal semantics. Our results include anextended example of where MetaML allows us to produce ecient programs, an explanation ofwhy implementing these constructs in traditional ways can be challenging, two formulations ofMetaML's semantics, a type system for MetaML, and a proposal for extending MetaML with atype construct for closedness.The dissertation consolidates a number of previous publications by the author, includingMetaML's type systems and big-step semantics. The presentation is new. The proposed solutionto an implementation problem and the reduction semantics for MetaML's three staging constructsare also new.

APA, Harvard, Vancouver, ISO, and other styles

6

Gong, Yun. "On semidefinite programming and vector quantization with application to image coding." Diss., Georgia Institute of Technology, 2000. http://hdl.handle.net/1853/14876.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Shi, Feng Gang. "Automatic coding from ZedCharts to SPARK Ada for safety-critical systems." Thesis, University of York, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.297155.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Qiwen, Xu. "A theory of state-based parallel programming." Thesis, University of Oxford, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.306838.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Potard, Guillaume. "3D-audio object oriented coding." Access electronically, 2006. http://www.library.uow.edu.au/adt-NWU/public/adt-NWU20061109.111639/index.html.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Dabis, Homam Sabih. "The computer enhancement of speech signals." Thesis, University of the West of Scotland, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.304636.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Computer programming. Coding theory"

1

Kelly, James F. Coding. New York, NY: Dorling Kindersley, 2017.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

ill, Prottsman Kiki, and Dorling Kindersley Inc, eds. My first coding book. New York: Dorling Kindersley, 2017.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Coding for kids for dummies. Hoboken, New Jersey: For Dummies, a Wiley Brand, 2015.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Brian, Peek, ed. Coding4Fun: 10 .NET programming projects for Wiimote, World of Warcraft, YouTube, and more. Sebastopol, CA: O'Reilly Media, 2009.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Fernandez, Dan. Coding4Fun: 10 .NET programming projects for Wiimote, World of Warcraft, YouTube, and more. Sebastopol, CA: O'Reilly Media, 2009.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Hello Ruby: Adventures in coding. New York: Feiwel & Friends, 2015.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

A practical guide to error-control coding using MATLAB. Boston: Artech House, 2010.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

ill, Henson Mike, ed. How to code: A step-by-step guide to computer coding. Lake Forest, CA: Quarto Library, 2017.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

ill, Henson Mike, ed. How to code: A step-by-step guide to computer coding. London: Quarto Library, 2017.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Andrew, Turpin, ed. Compression and coding algorithms. Boston: Kluwer Academic Publishers, 2002.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Computer programming. Coding theory"

1

O’Regan, Gerard. "Coding Theory." In Undergraduate Topics in Computer Science, 171–83. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-34209-8_11.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Bierbrauer, Jürgen. "The linear programming method." In Introduction to Coding Theory, 205–38. 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-17.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

O’Regan, Gerard. "Coding TheoryCoding Theory." In Texts in Computer Science, 171–83. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-44561-8_11.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Chemuturi, Murali. "Coding, Debugging, and Performance Tuning." In Computer Programming for Beginners, 153–70. Boca Raton : Taylor & Francis, 2019.: Chapman and Hall/CRC, 2018. http://dx.doi.org/10.1201/9780429453250-14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Klein, Shmuel Tomi, Shoham Saadia, and Dana Shapira. "Forward Looking Huffman Coding." In Computer Science – Theory and Applications, 203–14. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-19955-5_18.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Everest, Graham, Alf van der Poorten, Igor Shparlinski, and Thomas Ward. "Computer science and coding theory." In Mathematical Surveys and Monographs, 231–54. Providence, Rhode Island: American Mathematical Society, 2003. http://dx.doi.org/10.1090/surv/104/14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Sudan, Madhu. "Algorithmic issues in coding theory." In Lecture Notes in Computer Science, 184–99. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/bfb0058031.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Blinovsky, V. "Two Problems from Coding Theory." In Lecture Notes in Computer Science, 1075. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11889342_72.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Bierbrauer, Jürgen. "Orthogonal arrays in statistics and computer science." In Introduction to Coding Theory, 239–84. 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-18.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Guruswami, Venkatesan. "12 Sample Applications Outside Coding Theory." In Lecture Notes in Computer Science, 299–327. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30180-6_13.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Computer programming. Coding theory"

1

Gómez, Andrés Felipe, Andrés Colubri, and Jean Pierre Charalambos. "Shader Programming for Computational Arts and Design - A Comparison between Creative Coding Frameworks." In International Conference on Computer Graphics Theory and Applications. SCITEPRESS - Science and and Technology Publications, 2016. http://dx.doi.org/10.5220/0005678301610168.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Zhou, Baojian, and Wai Ho Mow. "A quadratic programming relaxation approach to compute-and-forward network coding design." In 2014 IEEE International Symposium on Information Theory (ISIT). IEEE, 2014. http://dx.doi.org/10.1109/isit.2014.6875243.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Pawelczak, Dieter. "Teaching Security in Introductory C-Programming Courses." In Sixth International Conference on Higher Education Advances. Valencia: Universitat Politècnica de València, 2020. http://dx.doi.org/10.4995/head20.2020.11114.

Full text

Abstract:

The challenges in the age of digitalization demand that universities qualify their computer science and engineering graduates well with respect to IT Security (information technology security). In engineering education such lectures are often offered as an elective subject, only. We propose to teach security aspects with respect to robustness and correctness already in the introductory programming course and therefore to cover at least parts of the overall field of IT Security as a compulsory subject for all students. The paper describes the integration of some rules and recommendations from the SEI Cert C Coding Standard into our introductory C programming course and discusses our experience with the course over the last two years with respect to its contents, realization, evaluation and examination.

APA, Harvard, Vancouver, ISO, and other styles

4

Berta, Mario, Francesco Borderi, Omar Fawzi, and Volkher B. Scholz. "Quantum Coding via Semidefinite Programming." In 2019 IEEE International Symposium on Information Theory (ISIT). IEEE, 2019. http://dx.doi.org/10.1109/isit.2019.8849325.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Corradini, Isabella, Michael Lodi, and Enrico Nardelli. "Coding and Programming." In SIGCSE '18: The 49th ACM Technical Symposium on Computer Science Education. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3159450.3162268.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Bachoc, Christine. "Applications of semidefinite programming to coding theory." In 2010 IEEE Information Theory Workshop (ITW 2010). IEEE, 2010. http://dx.doi.org/10.1109/cig.2010.5592938.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Parham-Mocello, Jennifer, and Martin Erwig. "Does Story Programming Prepare for Coding?" In SIGCSE '20: The 51st ACM Technical Symposium on Computer Science Education. New York, NY, USA: ACM, 2020. http://dx.doi.org/10.1145/3328778.3366861.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Sudan, M. "Coding theory: Tutorial & survey." In Proceedings 42nd IEEE Symposium on Foundations of Computer Science. IEEE, 2001. http://dx.doi.org/10.1109/sfcs.2001.959879.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Mishra, Rajesh, Deepanshu Vasal, and Hyeji Kim. "Linear Coding for AWGN Channels with Noisy Output Feedback via Dynamic Programming." In 2021 IEEE International Symposium on Information Theory (ISIT). IEEE, 2021. http://dx.doi.org/10.1109/isit45174.2021.9517955.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Jing Gong and Jiaqi Ji. "Integration of Constraint Programming and mathematical programming." In 2010 3rd International Conference on Advanced Computer Theory and Engineering (ICACTE 2010). IEEE, 2010. http://dx.doi.org/10.1109/icacte.2010.5579785.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Computer programming. Coding theory"

1

Keane, Michael K., and David W. Jensen. Computer Programming and Group Theory. Fort Belvoir, VA: Defense Technical Information Center, May 1990. http://dx.doi.org/10.21236/ada225155.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!