Publication Date
In 2025 | 0 |
Since 2024 | 1 |
Since 2021 (last 5 years) | 1 |
Since 2016 (last 10 years) | 1 |
Since 2006 (last 20 years) | 1 |
Descriptor
Algorithms | 12 |
Coding | 12 |
Information Theory | 7 |
Information Storage | 6 |
Mathematical Models | 6 |
Performance | 6 |
Evaluation | 5 |
Comparative Analysis | 4 |
Illustrations | 3 |
Tables (Data) | 3 |
Automation | 2 |
More ▼ |
Source
Information Processing &… | 7 |
PRIMUS | 1 |
Author
Storer, James A. | 2 |
Abrahams, Julia | 1 |
Bobbitt, L. G. | 1 |
Carroll, C. D. | 1 |
Constantinescu, Cornel | 1 |
Culik, Karel II | 1 |
Feygin, Gennady | 1 |
Frazier, Michael Duane | 1 |
Grumbach, Stephane | 1 |
Howard, Paul G | 1 |
Joshua Holden | 1 |
More ▼ |
Publication Type
Reports - Evaluative | 12 |
Journal Articles | 8 |
Speeches/Meeting Papers | 7 |
Dissertations/Theses -… | 1 |
Tests/Questionnaires | 1 |
Education Level
Higher Education | 1 |
Postsecondary Education | 1 |
Audience
Location
Laws, Policies, & Programs
Assessments and Surveys
Beginning Postsecondary… | 1 |
National Assessment of… | 1 |
What Works Clearinghouse Rating
Joshua Holden – PRIMUS, 2024
This paper describes Alkaline, a size-reduced version of Kyber, which has recently been announced as a prototype NIST standard for post-quantum public-key cryptography. While not as simple as RSA, I believe that Alkaline can be used in an undergraduate classroom to effectively teach the techniques and principles behind Kyber and post-quantum…
Descriptors: Technology, Coding, Undergraduate Study, Algebra

Abrahams, Julia – Information Processing & Management, 1994
Discusses the minimum average codeword length coding under the constraint that the codewords are monotonically nondecreasing in length. Bounds on the average length of an optimal monotonic code are derived, and sufficient conditions are given such that algorithms for optimal alphabetic codes can be used to find the optimal monotonic code. (six…
Descriptors: Algorithms, Coding, Illustrations, Information Theory
Frazier, Michael Duane – 1994
Computer task automation is part of the natural progression of encoding information. This thesis considers the automation process to be a question of whether it is possible to automatically learn the encoding based on the behavior of the system to be described. A variety of representation languages are considered, as are means for the learner to…
Descriptors: Algorithms, Automation, Coding, Computation
Stocking, Martha L.; And Others – 1991
A previously developed method of automatically selecting items for inclusion in a test subject to constraints on item content and statistical properties is applied to real data. Two tests are first assembled by experts in test construction who normally assemble such tests on a routine basis. Using the same pool of items and constraints articulated…
Descriptors: Algorithms, Automation, Coding, Computer Assisted Testing
Longford, Nicholas T. – 1994
This study is a critical evaluation of the roles for coding and scoring of missing responses to multiple-choice items in educational tests. The focus is on tests in which the test-takers have little or no motivation; in such tests omitting and not reaching (as classified by the currently adopted operational rules) is quite frequent. Data from the…
Descriptors: Algorithms, Classification, Coding, Models

Howard, Paul G; Vitter, Jeffrey Scott – Information Processing & Management, 1994
Describes a detailed algorithm for fast text compression. Related to the PPM (prediction by partial matching) method, it simplifies the modeling phase by eliminating the escape mechanism and speeds up coding by using a combination of quasi-arithmetic coding and Rice coding. Details of the use of quasi-arithmetic code tables are given, and their…
Descriptors: Algorithms, Coding, Electronic Text, Information Storage

Lin, Jianhua; Storer, James A. – Information Processing & Management, 1994
Describes the design of optimal tree-structured vector quantizers that minimize the expected distortion subject to cost functions related to storage cost, encoding rate, or quantization time. Since the optimal design problem is intractable in most cases, the performance of a general design heuristic based on successive partitioning is analyzed.…
Descriptors: Algorithms, Coding, Comparative Analysis, Costs

Constantinescu, Cornel; Storer, James A. – Information Processing & Management, 1994
Presents a new image compression algorithm that employs some of the most successful approaches to adaptive lossless compression to perform adaptive online (single pass) vector quantization with variable size codebook entries. Results of tests of the algorithm's effectiveness on standard test images are given. (12 references) (KRN)
Descriptors: Algorithms, Coding, Data Processing, Evaluation

Feygin, Gennady; And Others – Information Processing & Management, 1994
Presents two new algorithms for performing arithmetic coding without employing multiplication and discusses their implementation requirements. The first algorithm, suitable for an alphabet of arbitrary size, reduces the worst case excess length to under 0.8%. The second algorithm, suitable only for alphabets of less than 12 symbols, allows even…
Descriptors: Algorithms, Coding, Comparative Analysis, Evaluation

Culik, Karel II; Kari, Jarkko – Information Processing & Management, 1994
Presents an inference algorithm that produces a weighted finite automata (WFA), in particular, the grayness functions of graytone images. Image-data compression results based on the new inference algorithm produces a WFA with a relatively small number of edges. Image-data compression results alone and in combination with wavelets are discussed.…
Descriptors: Algorithms, Coding, Comparative Analysis, Data Processing

Grumbach, Stephane; Tahi, Fariza – Information Processing & Management, 1994
Analyzes the properties of genetic sequences that cause the failure of classical algorithms used for data compression. A lossless algorithm, which compresses the information contained in DNA and RNA sequences by detecting regularities such as palindromes, is presented. This algorithm combines substitutional and statistical methods and appears to…
Descriptors: Algorithms, Coding, Comparative Analysis, Databases
Bobbitt, L. G.; Carroll, C. D. – 1993
The National Center for Education Statistics conducts surveys which require the coding of the respondent's major field of study. This paper presents a new system for the coding of major field of study. It operates on-line i a Computer Assisted Telephone Interview (CATI) environment and allows conversational checks to verify coding directly from…
Descriptors: Algorithms, Coding, Computer Assisted Testing, Computer Software