Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Character encoding

Known as: Coded character, Character coding, Coded Character Set 
In computing, a character encoding is used to represent a repertoire of characters by some kind of an encoding system. Depending on the abstraction… Expand
Wikipedia

Related topics

Related topics

50 relations
ASCII artAdobe Atmosphere Community ServerArmenian alphabetBackward compatibility
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
High Dynamic Range Imaging: Acquisition, Display, and Image-Based Lighting
Foreword Preface 1 Introduction 2 Light And Color 3 HDR Image Encodings 4 HDR Image Capture 5 Display Devices 6 The Human Visual… Expand
Highly Cited
2006
Highly Cited
2006
The Base16, Base32, and Base64 Data Encodings
This document describes the commonly used base 64, base 32, and base 16 encoding schemes. It also discusses the use of line-feeds… Expand
  • table 2
  • table 3
  • table 4
  • table 5
Highly Cited
2005
Highly Cited
2005
Endomorphisms and automorphisms of the shift dynamical system
Let X(Se) be the set of all bisequences over a symbol set 6 a, where 1 < card S# < 0% and let cr be the shift transformation. If… Expand
Highly Cited
2000
Highly Cited
2000
Termites: Evolution, Sociality, Symbioses, Ecology
Contributors. Acknowledgements. Preface. Taxonomy and Phylogeny of Termites S. Kambhampati, P. Eggleton. Global Patterns of… Expand
  • figure 7
  • figure 8
  • figure 10
  • figure 11
  • figure 12
Highly Cited
1996
Highly Cited
1996
Pushing the Envelope: Planning, Propositional Logic and Stochastic Search
Planning is a notoriously hard combinatorial search problem. In many interesting domains, current planning algorithms fail to… Expand
  • table 1
  • table 2
  • table 3
Highly Cited
1995
Highly Cited
1995
Network security - private communication in a public world
The classic guide to network securityi¾–now fully updated!"Bob and Alice are back!"Widely regarded as the most comprehensive yet… Expand
Highly Cited
1992
Highly Cited
1992
Fast text searching: allowing errors
T h e string-matching problem is a very c o m m o n problem. We are searching for a string P = PtP2. . "Pro i n s i d e a la rge… Expand
  • table I
  • figure 1
Highly Cited
1990
Highly Cited
1990
Lex—a lexical analyzer generator
Lex helps write programs whose control flow is directed by instances of regular expressions in the input stream. It is well… Expand
Highly Cited
1985
Highly Cited
1985
Applying Adaptive Algorithms to Epistatic Domains
John Holland has shown that when adaptive algorithms are used to search certain kinds of extremely large problem spaces, they… Expand
Highly Cited
1975
Highly Cited
1975
Depth of processing and the retention of words
SUMMARY Ten experiments were designed to explore the levels of processing framework for human memory research proposed by Craik… Expand
  • table 1
  • table 2
  • figure 1
  • figure 2
  • table 3
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE