%{search_type} search results

• Keynote Presentation.- Information Systems for Crisis Response and Management.- Medical Services.- Aspects of Anatomical and Chronological Sequence Diagrams in Software-Supported Emergency Care Patient Report Forms.- Mobile Devices in Emergency Medical Services: User Evaluation of a PDA-Based Interface for Ambulance Run Reporting.- Feasible Hardware Setups for Emergency Reporting Systems.- Team Support.- Supporting Implicit Coordination Between Distributed Teams in Disaster Management.- AMIRA: Advanced Multi-modal Intelligence for Remote Assistance.- SaR Resource Management Based on Description Logics.- Geospatial Information.- Adding Space to Location in Mobile Emergency Response Technologies.- Intelligent Cartographic Presentations for Emergency Situations.- Hybrid Radio Frequency Identification System for Use in Disaster Relief as Positioning Source and Emergency Message Boards.- Wearable Computing.- Managing Catastrophic Events by Wearable Mobile Systems.- Towards the Integration of Real-Time Real-World Data in Urban Search and Rescue Simulation.- Playing with Fire: User-Centered Design of Wearable Computing for Emergency Response.- Communication Technology.- Improving Communication for Mobile Devices in Disaster Response.- Robust Audio Indexing and Keyword Retrieval Optimized for the Rescue Operation Domain.- Extending the Fire Dispatch System into the Mobile Domain.- Recalling Resilient Actions During Emergency Response.
• (source: Nielsen Book Data)

This book constitutes the thoroughly refereed post-proceedings of the First International Workshop on Mobile Information Technology for Emergency Response, MobileResponse 2007 held in Sankt Augustin, Germany in February 2007. The 16 revised papers presented together with one keynote lecture were carefully reviewed and selected. The papers are organized in topical sections on medical services, team support, geospatial information, wearable computing, and communication technology.
(source: Nielsen Book Data)

• Overview of the HECKTOR Challenge at MICCAI
• 2020: Automatic Head and Neck Tumor Segmentation in PET/CT.- Two-stage approach for segmenting gross tumor volume in head and neck cancer with CT and PET imaging.- The Head and Neck Tumor Segmentation Using nnU-Net with Spatial and Channel 'Squeeze & Excitation' Blocks.- Squeeze-and-Excitation Normalization for Automated Delineation of Head and Neck Primary Tumors in Combined PET and CT Images.- Automatic Head and Neck Tumor Segmentation in PET/CT with Scale Attention Network.- Iteratively Refine the Segmentation of Head and Neck Tumor in FDG-PET and CT images.- Combining CNN and Hybrid Active Contours for Head and Neck Tumor Segmentation in CT and PET images.- Oropharyngeal Tumour Segmentation using Ensemble 3D PET-CT Fusion Networks for the HECKTOR Challenge.- Patch-based 3D UNet for Head and Neck Tumor Segmentation with an Ensemble of Conventional and Dilated Convolutions.- Tumor Segmentation in Patients with Head and Neck Cancers using Deep Learning based-on Multi-modality PET/CT Images.- GAN-based Bi-modal Segmentation using Mumford-Shah Loss: Application to Head and Neck Tumors in PET-CT Images.
• (source: Nielsen Book Data)

This book constitutes the First 3D Head and Neck Tumor Segmentation in PET/CT Challenge, HECKTOR 2020, which was held in conjunction with the 23rd International Conference on Medical Image Computing and Computer-Assisted Intervention, MICCAI 2020, in Lima, Peru, in October 2020. The challenge took place virtually due to the COVID-19 pandemic.The 2 full and 8 short papers presented together with an overview paper in this volume were carefully reviewed and selected form numerous submissions. This challenge aims to evaluate and compare the current state-of-the-art methods for automatic head and neck tumor segmentation. In the context of this challenge, a dataset of 204 delineated PET/CT images was made available for training as well as 53 PET/CT images for testing. Various deep learning methods were developed by the participants with excellent results.
(source: Nielsen Book Data)

• Segmentation.- Vessels-Cut: A Graph Based Approach to Patient-Specific Carotid Arteries Modeling.- Interactive Segmentation of Volumetric Medical Images for Collaborative Telemedicine.- Simultaneous Segmentation and Correspondence Establishment for Statistical Shape Models.- The Persistent Morse Complex Segmentation of a 3-Manifold.- Anatomical and Physiological Modeling.- Modelling Rod-Like Flexible Biological Tissues for Medical Training.- Using Musculoskeletal Modeling for Estimating the Most Important Muscular Output - Force.- Computer Assisted Estimation of Anthropometric Parameters from Whole Body Scanner Data.- Simulation Models.- A Physiological Torso Model for Realistic Breathing Simulation.- Evaluating the Impact of Shape on Finite Element Simulations in a Medical Context.- MotionLab: A Matlab Toolbox for Extracting and Processing Experimental Motion Capture Data for Neuromuscular Simulations.- Motion Analysis.- Predicting Missing Markers in Real-Time Optical Motion Capture.- Motion Analysis of the Arm Based on Functional Anatomy.- WAPA: A Wearable Framework for Aerobatic Pilot Aid.- Discriminative Human Full-Body Pose Estimation from Wearable Inertial Sensor Data.- Medical Visualization and Interaction.- A 3D Human Brain Atlas.- Context Preserving Focal Probes for Exploration of Volumetric Medical Datasets.- Use of High Dynamic Range Images for Improved Medical Simulations.- Medical Ontology.- My Corporis Fabrica: A Unified Ontological, Geometrical and Mechanical View of Human Anatomy.- Formal Representation of Tissue Geometric Features by DOGMA Ontology.
• (source: Nielsen Book Data)

Thisbook presentsrecentadvancesinthedomainofthe3Dphysiologicalhuman that werepresentedlastDecember at the Workshopon 3D PhysiologicalHuman 2009 that was held in Zermatt, Switzerland. This workshop was funded by the "Third Cycle in Computer Science of Western Switzerland" named CUSO, the European project Focus K3D (ICT-2007-214993), the European Marie Curie project 3D Anatomical Human (MRTN-CT-2006-035763) and the European Network of Excellence InterMedia (NoE-IST-2006-038419). 3D physiological human research is a very active ?eld supported by several scienti?c projects. Many of them are funded by the European Union, such as the 3D Anatomical Human project and those present in the seventh framework programme "Virtual Physiological Human"(FP7-ICT-2007-2). One of the main objectivesof the researchon 3D physiologicalhuman is to create patient-speci?c computer models for personalized healthcare.These models are used to simulate and hence better understand the human physiology and pathology.There is also a synergy in this research in the way medical information is distributed: to have any model available anytime, anywhere on any mobile equipment. A collection of scienti?c articles was proposed to highlight the necessity to exchange and disseminate novel ideas and techniques from a wide range of d- ciplines (computer graphics, biomechanics, knowledge representation, human- machine interface, mobile computing, etc. ) associated with medical imaging, medical simulation, computer-assisted surgery and 3D semantics. The emphasis wason technicalnoveltyalongwith currentandfuture applications for modeling and simulating the anatomical structures and functions of the human body.
(source: Nielsen Book Data)

• Accelerating Agent-Based Ecosystem Models Using the Cell Broadband Engine
• Performance Impact of Task Mapping on the Cell BE Multicore Processor
• Parallelization Strategy for CELL TV
• Towards User Transparent Parallel Multimedia Computing on GPU-Clusters
• Implementing a GPU Programming Model on a Non-GPU Accelerator Architecture
• On the Use of Small 2D Convolutions on GPUs
• Can Manycores Support the Memory Requirements of Scientific Applications?
• Parallelizing an Index Generator for Desktop Search
• Computation vs. Memory Systems: Pinning Down Accelerator Bottlenecks
• Trace Execution Automata in Dynamic Binary Translation
• ISAMAP: Instruction Mapping Driven by Dynamic Binary Translation
• Parallelization of Particle Filter Algorithms
• What Kinds of Applications Can Benefit from Transactional Memory?
• Characteristics of Workloads Using the Pipeline Programming Model
• The Search for Energy-Efficient Building Blocks for the Data Center
• KnightShift: Shifting the I/O Burden in Datacenters to Management Processor for Energy Efficiency
• Guarded Power Gating in a Multi-core Setting
• Using Partial Tag Comparison in Low-Power Snoop-Based Chip Multiprocessors
• Achieving Power-Efficiency in Clusters without Distributed File System Complexity
• What Computer Architects Need to Know about Memory Throttling
• Predictive Power Management for Multi-core Processors
• IOMMU: Strategies for Mitigating the IOTLB Bottleneck
• Improving Server Performance on Multi-cores via Selective Off-Loading of OS Functionality
• Performance Characteristics of Explicit Superpage Support
• Interfacing Operating Systems and Polymorphic Computing Platforms Based on the MOLEN Programming Paradigm
• Extrinsic and Intrinsic Text Cloning
• A Case for Coordinated Resource Management in Heterogeneous Multicore Platforms
• Topology-Aware Quality-of-Service Support in Highly Integrated Chip Multiprocessors.

This book constitutes the thoroughly refereed post-conference proceedings of the workshops held at the 37th International Symposium on Computer Architecture, ISCA 2010, in Saint-Malo, France, in June 2010. The 28 revised full papers presented were carefully reviewed and selected from the lectures given at 5 of these workshops. The papers address topics ranging from novel memory architectures to emerging application design and performance analysis and encompassed the following workshops: A4MMC, applications for multi- and many-cores; AMAS-BT, 3rd workshop on architectural and micro-architectural support for binary translation; EAMA, the 3rd Workshop for emerging applications and many-core architectures; WEED, 2nd Workshop on energy efficient design, as well as WIOSCA, the annual workshop on the interaction between operating systems and computer architecture.

• Constructions of Free Commutative Integro-Differential Algebras
• Basic Module Theory over Non-commutative Rings with Computational Aspects of Operator Algebras
• Operational Calculi for Nonlocal Cauchy Problems in Resonance Cases
• Intertwining Laplace Transformations of Linear Partial Differential Equations
• Composing and Factoring Generalized Green's Operators and Ordinary Boundary Problems
• Relativistic Coulomb Integrals and Zeilberger's Holonomic Systems Approach II
• Multivariate Dimension Polynomials of Inversive Difference Field Extensions
• Differential (Monoid) Algebra and More
• Exact Solution of Local and Nonlocal BVPs for the Laplace Equation in a Rectangle.

This book constitutes the proceedings of the 5th International Meeting on Algebraic and Algorithmic Aspects of Differential and Integral Operators, AADIOS 2012, held at the Applications of Computer Algebra Conference in Sofia, Bulgaria, on June 25-28, 2012. The total of 9 papers presented in this volume consists of 2 invited papers and 7 regular papers which were carefully reviewed and selected from 13 submissions. The topics of interest are: symbolic computation for operator algebras, factorization of differential/integral operators, linear boundary problems and green's operators, initial value problems for differential equations, symbolic integration and differential galois theory, symbolic operator calculi, algorithmic D-module theory, rota-baxter algebra, differential algebra, as well as discrete analogs and software aspects of the above.

• Sequence based methods for data transmission and source compression / A.R. Calderbank, P.C. Fishburn, A. Rabinovich
• On the apparent duality of the Kerdock and Preparata codes / A.R. Hammons [and others]
• Bounds for codes as solutions of extremum problems for systems of orthogonal polynomials / V. Levenshtein
• Systems of algebraic equations solved by means of endomorphisms / H.M. Moller
• Criteria for sequence set design in CDMA communications / R.A. Scholtz
• Using Groebner bases to determine the algebraic and transcendental nature of field extensions: return of the killer tag variables / M. Sweedler
• A "divide and conquer" algorithm for Hilbert-Poincare series, multiplicity and dimension of monomial ideals / A.M. Bigatti [and others]
• An efficient algorithm for the sparse mixed resultant / J.F. Canny, I. Emiris
• Some features of binary block codes for correcting asymmetric errors / G. Fang [and others]
• Fixed-parameter complexity and cryptography / M.R. Fellows, N. Koblitz
• A class of algebraic geometric codes from curves in high-dimensional projective spaces / G.L. Feng, T.R.N. Rao
• A new class of sequences / G. Gong
• A zero-test and an interpolation algorithm for the shifted sparse polynomials / D. Grigoriev, M. Karpinski
• Parallelization of quantifier elimination on a workstation network / H Hong
• Hyperplane sections of fermat varieties in P³ in char. 2 and some applications to cyclic codes / H. Janwa, R.M. Wilson
• Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems / E. Kaltofen
• Relations among lie formal series and construction of symplectic integrators / P.-V. Koseleff
• Exponential sums as discrete Fourier transform with invariant phase functions / G. Lachaud
• Application of finite fields to memory interleaving / A. Lempel, G. Seroussi
• An elementary proof of a partial improvement to the Ax-Katz theorem / O. Moreno, C.J. Moreno
• Energy functions associated with error-correcting codes / C. Renteria, H. Tapia-Recillas
• On determining all codes in semi-simple group rings / R.E. Sabin
• On hyperbolic cascaded Reed-Solomon codes / K. Saints, C. Heegard
• Peak-shift and bit error-correction with channel side information in runlength-limited sequences / Y. Saitoh, I. Ibe, H. Imai
• On a third order differential equation whose differential galois group is the simple group of 168 elements / M.F. Singer, F. Ulmer
• Approximating the number of error locations within a constant ratio is NP-complete / J. Stern
• Two chosen plaintext attacks on the Li-wang joint authentication and encryption scheme / J. van Tilburg
• Some constructions of perfect binary codes / A. Vardy, T. Etzion.

"This volume is the proceedings of the 10th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC 10), held in Puerto Rico, May 1993. The aim of the AAECC meetings is to attract high-level research papers and to encourage cross-fertilization among different areas which share the use of algebraic methods and techniques for applications in the sciences of computing, communications, and engineering. The AAECC symposia are mainly devoted to research in coding theory and computer algebra. The theoryof error-correcting codes deals with the transmission of information in the presence of noise. Coding is the systematic use of redundancy in theformation of the messages to be sent so as to enable the recovery of the information present originally after it has been corrupted by (not too much)noise. Computer algebra is devoted to the investigation of algorithms, computational methods, software systems and computer languages, oriented to scientific computations performed on exact and often symbolic data, by manipulating formal expressions by means of the algebraic rules they satisfy. Questions of complexity and cryptography are naturally linked with both coding theory and computer algebra and represent an important share of the area covered by AAECC."--PUBLISHER'S WEBSITE

• Supports of a code.- Chemical isomerism, a challenge for algebraic combinatorics and for computer science.- On algebraic methods in covering radius problems.- How lower and upper complexity bounds meet in elimination theory.- Bivariate polynomial multiplication patterns.- Division of entire functions by polynomial ideals.- Variations on minimal codewords in linear codes.- On the computation of the radical of polynomial complete inter
• section ideals.- Which families of long binary linear codes have a binomial weight distribution?.- The discovery of simple 7-designs with automorphism group P?L(2, 32).- Fast exponentation in cryptography.- On maximal spherical codes I.- Formal computation of Galois groups with relative resolvents.- A case of automatic theorem proving in Euclidean geometry: the Maclane 83 theorem.- Isometry classes of indecomposable linear codes.- When polynomial equation systems can be "solved" fast?.- Using symmetric functions to describe the solution set of a zero dimensional ideal.- Triangular systems and factorized Groebner bases.- Computation in algebraic function fields for effective construction of algebraic-geometric codes.- Singly-even self-dual codes and Hadamard matrices.- Implicitization of curves parameterized by generalized trigonometric polynomials.- Randomness properties of partial ? - ? planes as LSI test inputs and their implementations.- Mixed covering codes with two binary and four ternary coordinates.- About approximations of exponentials.- A note on normal bases.- On the covering radius of long Goppa codes.- Integration of multivariate rational functions given by straight-line programs.- Polynomial gcd computations over towers of algebraic extensions.- Displacements of matrix products.- Testing identities of series defined by algebraic partial differential equations.- The complexity of formal resolution of linear partial differential equations.- A fast parallel implementation of the Berlekamp-Massey algorithm with a 1D systolic array architecture.- Tomography of constructible functions.- On the determination of formal solutions of a system of partial differential equations.- D 4, E 6, E 8 and the AGM.- Computation of the Galois groups of the resolvent factors for the direct and inverse Galois problems.- First integrals and Darboux polynomials of homogeneous linear differential systems.
• (source: Nielsen Book Data)

This book constitutes the proceedings of the 11th International Conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-11, held in Paris, France in July 1995. The volume presents five invited papers and 32 full revised research papers selected from a total of 68 submissions; it is focussed on research directed to the exploitation of algebraic techniques and methodologies for the application in coding and computer algebra. Among the topics covered are coding, cryptoloy, communication, factorization of polynomials, Groebner bases, computer algebra, algebraic algorithms, symbolic computation, algebraic manipulation.
(source: Nielsen Book Data)

• Minimun distance decoding algorithms for linear codes.- Efficient multivariate factorization over finite fields.- On maximal codes in polynomial metric spaces.- Yet another ideal decomposition algorithm.- A resultant theory for ordinary algebraic differential equations.- The symmetry group of ? q n in the Lee space and the ? q n-linear codes.- On repeated-root cyclic codes and the two-way chain condition.- Exponentiation in finite fields: Theory and practice.- Computing minimum-link path in a homotopy class amidst semi-algebraic obstacles in the plane.- Certain self-dual codes over ?4 and the odd Leech lattice.- Order functions and evaluation codes.- Codes from cocycles.- A brief tour of split linear programming.- Elementary approximation of exponentials of Lie polynomials.- On the q-ary image of cyclic codes.- The split weight (w L , w R ) enumeration of Reed-Muller codes for w L +w R d min.- Optimal linear codes of dimension 4 over GF(5).- Characterisations of lexicographic sets and simply-connected Hilbert schemes.- An iterative probabilistic decoding algorithm for binary linear block codes beyond the half minimum distance.- Security examination of a cellular automata based pseudorandom bit generator using an algebraic replica approach.- Formal duality of linearly presentable codes over a Galois field.- Trace-function on a Galois ring in coding theory.- A vector version of the BMS algorithm for implementing fast erasure-and-error decoding of one-point AG codes.- On generalized Hamming weights of codes constructed on affine algebraic sets.- Some results on regular mappings.- Extension theorems for linear codes over finite rings.- Nonperiodic cyclic equivalence classes of cyclic codes and algebraic constructions of cyclically permutable codes.
• (source: Nielsen Book Data)

This book constitutes the strictly refereed proceedings of the 12th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-12, held in Toulouse, France, June 1997. The 27 revised full papers presented were carefully selected by the program committee for inclusion in the volume. The papers address a broad range of current issues in coding theory and computer algebra spanning polynomials, factorization, commutative algebra, real geometry, group theory, etc. on the mathematical side as well as software systems, telecommunication, complexity theory, compression, signal processing, etc. on the computer science and engineering side.
(source: Nielsen Book Data)

• Invited Papers.- Codes on Graphs: A Survey for Algebraists.- RA Codes Achieve AWGN Channel Capacity.- Monomial Ideals and Planar Graphs.- A Fast Program Generator of Fast Fourier Transforms.- On Integer Programming Problems Related to Soft-Decision Iterative Decoding Algorithms.- Curves with Many Points and Their Applications.- Codes and Iterative Decoding.- New Sequences of Linear Time Erasure Codes Approaching the Channel Capacity.- On the Theory of Low-Density Convolutional Codes.- Combinatorics I: Arithmetic.- On the Distribution of Nonlinear Recursive Congruential Pseudorandom Numbers of Higher Orders.- A New Representation of Boolean Functions.- Combinatorics II: Graphs and Matrices.- An Algorithm to Compute a Nearest Point in the Lattice A n * .- Sequences from Cocycles.- Block Codes I.- On the Second Greedy Weight for Binary Linear Codes.- On the Size of Identifying Codes.- Algebra I: Rings and Fields.- Fast Quantum Fourier Transforms for a Class of Non-abelian Groups.- Linear Codes and Rings of Matrices.- On ?4-Simplex Codes and Their Gray Images.- Decoding Methods.- Some Results on Generalized Concatenation of Block Codes.- Near Optimal Decoding for TCM Using the BIVA and Trellis Shaping.- An Optimality Testing Algorithm for a Decoded Codeword of Binary Block Codes and Its Computational Complexity.- Algebra II.- Recursive MDS-Codes and Pseudogeometries.- Strength of ISTY1 without FL Function for Higher Order Differential Attack.- Code Construction.- Quantum Reed-Solomon Codes.- Capacity Bounds for the 3-Dimensional (0, 1) Runlength Limited Channel.- Rectangular Codes and Rectangular Algebra.- Codes and Algebra I: Algebraic Curves.- Decoding Hermitian Codes with Sudan's Algorithm.- Computing a Basis of
• on an affine algebraic curve with one rational place at infinit.- Cryptography.- Critical Noise for Convergence of Iterative Probabilistic Decoding with Belief Propagation in Cryptographic Applications.- An Authentication Scheme over Non-authentic Public Channel in Information-Theoretic Secret-Key Agreement.- Codes and Decoding.- A Systolic Array Architecture for Fast Decoding of One-Point AG Codes and Scheduling of Parallel Processing on It.- Convolutional Codes.- Computing Weight Distributions of Convolutional Codes Via Shift Register Synthesis.- Properties of Finite Response Input Sequences of Recursive Convolutional Codes.- Combinatorics III: Designs.- Lower Bounds for Group Covering Designs.- Characteristic Functions of Relative Difference Sets, Correlated Sequences and Hadamard Matrices.- Decoding of Block Codes.- Double Circulant Self-Dual Codes Using Finite-Field Wavelet Transforms.- Algebra III: Rings and Fields.- Linear Codes and Polylinear Recurrences over Finite Rings and Modules (A Survey).- Calculating Generators for Invariant Fields of Linear Algebraic Groups.- Constructing Elements of Large Order in Finite Fields.- Modulation and Codes.- New Lower Bounds on the Periodic Crosscorrelation of QAM Codes with Arbitrary Energy.- Conjectures on the Size of Constellations Constructed from Direct Sums of PSK Kernels.- Codes and Algebra II: Groebner Bases and AG Codes.- A New Criterion for Normal Form Algorithms.- Discrete Fourier Transform and Groebner Bases.- Block Codes II.- On the State Complexities of Ternary Codes.- Binary Optimal Linear Rate 1/2 Codes.- On Binary/Ternary Error-Correcting Codes with Minimum Distance 4.- Algebra IV: Polynomials.- The Euclidean Algorithm and Primitive Polynomials over Finite Fields.- On the Computational Hardness of Testing Square-Freeness of Sparse Polynomials.- Mastrovito Multiplier for General Irreducible Polynomials.
• (source: Nielsen Book Data)

This book constitutes the refereed proceedings of the 19th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-13, held in Honolulu, Hawaii, USA in November 1999. The 42 revised full papers presented together with six invited survey papers were carefully reviewed and selected from a total of 86 submissions. The papers are organized in sections on codes and iterative decoding, arithmetic, graphs and matrices, block codes, rings and fields, decoding methods, code construction, algebraic curves, cryptography, codes and decoding, convolutional codes, designs, decoding of block codes, modulation and codes, Groebner bases and AG codes, and polynomials.
(source: Nielsen Book Data)

This book constitutes the refereed proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-14, held in Melbourne, Australia in November 2001. The 36 revised full papers presented together with four invited papers were carefully reviewed and selected from 61 submissions. The papers are organized in topical sections on block codes, code constructions, codes and algebra - rings and fields, codes and algebra - algebraic geometry codes, sequences, cryptography, algorithms, algorithms - decoding, and algebraic constructions.
(source: Nielsen Book Data)

This book constitutes the refereed proceedings of the 15th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-15, held in Toulouse, France, in May 2003. The 25 revised full papers presented together with 2 invited papers were carefully reviewed and selected from 40 submissions. Among the subjects addressed are block codes; algebra and codes: rings, fields, and AG codes; cryptography; sequences; decoding algorithms; and algebra: constructions in algebra, Galois groups, differential algebra, and polynomials.
(source: Nielsen Book Data)

This book constitutes the refereed proceedings of the 16th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-16, held in Las Vegas, NV, USA in February 2006. The 25 revised full papers presented together with 7 invited papers were carefully reviewed and selected from 32 submissions. Among the subjects addressed are block codes; algebra and codes: rings, fields, and AG codes; cryptography; sequences; decoding algorithms; and algebra: constructions in algebra, Galois groups, differential algebra, and polynomials.
(source: Nielsen Book Data)

• Invited Contributions.- List Decoding and Pseudorandom Constructions.- A Survey of Recent Attacks on the Filter Generator.- Iterative List Decoding of LDPC Codes.- Inverted Edwards Coordinates.- Spectra of Boolean Functions, Subspaces of Matrices, and Going Up Versus Going Down.- Efficient List Decoding of Explicit Codes with Optimal Redundancy.- Algebraic Structure Theory of Tail-Biting Trellises.- Nice Codes from Nice Curves.- Regular Contributions.- Generalized Sudan's List Decoding for Order Domain Codes.- Bent Functions and Codes with Low Peak-to-Average Power Ratio for Multi-Code CDMA.- Determining the Nonlinearity of a New Family of APN Functions.- An Improvement of Tardos's Collusion-Secure Fingerprinting Codes with Very Short Lengths.- Space-Time Codes from Crossed Product Algebras of Degree 4.- On Non-randomness of the Permutation After RC4 Key Scheduling.- Correctable Errors of Weight Half the Minimum Distance Plus One for the First-Order Reed-Muller Codes.- Fault-Tolerant Finite Field Computation in the Public Key Cryptosystems.- A Note on a Class of Quadratic Permutations over
• Constructions of Orthonormal Lattices and Quaternion Division Algebras for Totally Real Number Fields.- Quaternary Plotkin Constructions and Quaternary Reed-Muller Codes.- Joint Source-Cryptographic-Channel Coding Based on Linear Block Codes.- On the Key-Privacy Issue of McEliece Public-Key Encryption.- Lattices for Distributed Source Coding: Jointly Gaussian Sources and Reconstruction of a Linear Function.- Linear Complexity and Autocorrelation of Prime Cube Sequences.- The "Art of Trellis Decoding" Is NP-Hard.- On the Structure of Inversive Pseudorandom Number Generators.- Subcodes of Reed-Solomon Codes Suitable for Soft Decoding.- Normalized Minimum Determinant Calculation for Multi-block and Asymmetric Space-Time Codes.- On the Computation of Non-uniform Input for List Decoding on Bezerra-Garcia Tower.- Dense MIMO Matrix Lattices - A Meeting Point for Class Field Theory and Invariant Theory.- Secure Cross-Realm Client-to-Client Password-Based Authenticated Key Exchange Against Undetectable On-Line Dictionary Attacks.- Links Between Discriminating and Identifying Codes in the Binary Hamming Space.- Construction of Rotation Symmetric Boolean Functions on Odd Number of Variables with Maximum Algebraic Immunity.- A Path to Hadamard Matrices.- The Tangent FFT.- Novel Algebraic Structure for Cyclic Codes.- Distribution of Trace Values and Two-Weight, Self-orthogonal Codes over GF(p, 2).- Generalized Rotation Symmetric and Dihedral Symmetric Boolean Functions ? 9 Variable Boolean Functions with Nonlinearity 242.- On Quasi-cyclic Codes over Integer Residue Rings.- Extended Norm-Trace Codes with Optimized Correction Capability.- On Generalized Hamming Weights and the Covering Radius of Linear Codes.- Homomorphic Encryptions of Sums of Groups.
• (source: Nielsen Book Data)

This book constitutes the refereed proceedings of the 17th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-17, held in Bangalore, India, in December 2007. Among the subjects addressed are block codes, including list-decoding algorithms; algebra and codes: rings, fields, algebraic geometry codes; algebra: rings and fields, polynomials, permutations, lattices; cryptography: cryptanalysis and complexity; computational algebra.
(source: Nielsen Book Data)

• Codes.- The Order Bound for Toric Codes.- An Extension of the Order Bound for AG Codes.- Sparse Numerical Semigroups.- From the Euclidean Algorithm for Solving a Key Equation for Dual Reed-Solomon Codes to the Berlekamp-Massey Algorithm.- Rank for Some Families of Quaternary Reed-Muller Codes.- Optimal Bipartite Ramanujan Graphs from Balanced Incomplete Block Designs: Their Characterizations and Applications to Expander/LDPC Codes.- Simulation of the Sum-Product Algorithm Using Stratified Sampling.- A Systems Theory Approach to Periodically Time-Varying Convolutional Codes by Means of Their Invariant Equivalent.- On Elliptic Convolutional Goppa Codes.- The Minimum Hamming Distance of Cyclic Codes of Length 2p s
• There Are Not Non-obvious Cyclic Affine-invariant Codes.- On Self-dual Codes over Z 16
• Cryptography.- A Non-abelian Group Based on Block Upper Triangular Matrices with Cryptographic Applications.- Word Oriented Cascade Jump ??LFSR.- On Some Sequences of the Secret Pseudo-random Index j in RC4 Key Scheduling.- Very-Efficient Anonymous Password-Authenticated Key Exchange and Its Extensions.- Efficient Constructions of Deterministic Encryption from Hybrid Encryption and Code-Based PKE.- Algebra.- Noisy Interpolation of Multivariate Sparse Polynomials in Finite Fields.- New Commutative Semifields and Their Nuclei.- Spreads in Projective Hjelmslev Geometries.- On the Distribution of Nonlinear Congruential Pseudorandom Numbers of Higher Orders in Residue Rings.- Rooted Trees Searching for Cocyclic Hadamard Matrices over D 4t
• Extended Abstracts.- Interesting Examples on Maximal Irreducible Goppa Codes.- Repeated Root Cyclic and Negacyclic Codes over Galois Rings.- Construction of Additive Reed-Muller Codes.- Grobner Representations of Binary Matroids.- A Generalization of the Zig-Zag Graph Product by Means of the Sandwich Product.- Novel Efficient Certificateless Aggregate Signatures.- Bounds on the Number of Users for Random 2-Secure Codes.
• (source: Nielsen Book Data)

The AAECC symposia serieswas started in 1983by Alain Poli (Toulouse), who, together with R. Desq, D. Lazardand P. Camion, organizedthe ?rst conference. OriginallytheacronymAAECCstoodfor"AppliedAlgebraandError-Correct ing Codes."Overtheyearsitsmeaninghasshiftedto"AppliedAlgebra, Algebraic- gorithmsandError-CorrectingCodes, "re?ectingthegrowingimportanceofc- plexity, particularlyfor decoding algorithms.During the AAECC-12 symposium the ConferenceCommitteedecidedtoenforcethe theoryandpracticeofthe c- ing side as well as the cryptographic aspects. Algebra was conserved, as in the past, but slightly more oriented to algebraic geometry codes, ?nite ?elds, c- plexity, polynomials, andgraphs. The main topics for AAECC-18 were algebra, algebraiccomputation, codes and algebra, codes and combinatorics, modulation and codes, sequences, and cryptography. TheinvitedspeakersofthiseditionwereIwanDuursma, HenningStichtenoth, and Fernando Torres. We would like to express our deep regret for the loss of Professor Ralf Kotter, .. who recently passed away and could not be our fourth invited speaker. Except for AAECC-1 (Discrete Mathematics 56, 1985) and AAECC-7 (D- crete Applied Mathematics 33, 1991), the proceedings of all the symposia have been published in Springer'sLecture Notes in Computer Science (Vols. 228,229, 307, 356, 357, 508, 539, 673, 948, 1255, 1719, 2227, 2643, 3857, 4851). Itis apolicy ofAAECCto maintaina highscienti?c standard, comparableto that of a journal. This was made possible thanks to the many referees involved. Each submitted paper was evaluated by at least two international researchers. AAECC-18 received and refereed 50 submissions. Of these, 22 were selected for publication in these proceedings as regular papers and 7 were selected as extended abstracts.
(source: Nielsen Book Data)

• On associative algebras of minimal rank
• Construction of primitive idempotents for a variable codes
• Multivariate polynomials in coding theory
• Enumeration of self dual 2k circulant codes
• Codes, groups and invariants
• On a conjecture concerning coverings of Hamming space
• An improved upper bound on covering radius
• Association schemes and difference sets defined on two weight codes
• Automorphisms of two families of extended non binary cyclic Goppa Codes
• Some quasi-perfect cyclic codes
• Explicit Kerdock codes over GF(2)
• Une classe de codes 2-correcteurs adaptes aux systems d'information formates
• LOUSTICC simulation software : Experimental results of coding systems
• An algorithm of complete decoding of double-error-correcting goppa codes
• On the number of divisors of a polynomial over GF(2)
• Multivariate polynomial factoring and detection of true factors
• Discriminants and the irreducibility of a class of polynomials
• Computational aspects of reduction strategies to construct resolutions of monomial ideals
• Designs arising from symplectic geometry
• Distance
• transitive graphs and the problem of maximal subgroups of symmetric groups
• Can a fast signature scheme without secret key be secure / Un Schema de Signature Courte et Rapide N'Utilisant pas de CLE Secrete Peut-IL Etre Fiable?
• Manipulation of recurrence relations in computer algebra
• Some design principles for a mathematical knowledge representation system: A new approach to scientific calculation.